Computing A Well-Representative Summary of Conjunctive Query Results

Summary: Computes k-sized summaries of conjunctive query results under cohesion (k-center) and diversity. Leverages oracle-based access to avoid enumeration, yielding O(1)-approximation in near-linear time (in N, poly(k)) and a 2+ε-approximation for k-center on relational data. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 1953
Venue: PODS
Year: 2024
Pagerank: 4.1945683e-05
Overall Rank: 10,927 | 23.99%
DOI: 10.1145/3695835

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
10,003	Clustering with Set Outliers and Applications in Relational Clustering	2026	PODS	4.1945683e-05
10,924	Improved Approximation Algorithms for Relational Clustering	2024	PODS	4.1945683e-05

Outgoing Citations (Sorted by Pagerank)

Showing 17 of 17 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
18	On Random Sampling over Joins	1999	SIGMOD	0.00092385438
184	New Sampling-Based Summary Statistics for Improving Approximate Query Answers	1998	SIGMOD	0.00036625711
325	The History of Histograms (abridged)	2003	VLDB	0.00027378328
326	Optimal Histograms with Quality Guarantees	1998	VLDB	0.00027358981
402	Mergeable Summaries	2012	PODS	0.00024196343
1,369	Random Sampling over Joins Revisited	2018	SIGMOD	0.00012339777
1,400	Wavelet Synopses with Error Guarantees	2002	SIGMOD	0.00012191684
1,725	Max-Sum Diversification, Monotone Submodular Functions and Dynamic Updates	2012	PODS	0.00010748322
4,953	On Join Sampling and the Hardness of Combinatorial Output-Sensitive Join Algorithms	2023	PODS	5.8085795e-05
5,104	Guaranteeing the O~(AGM/OUT) Runtime for Uniform Sampling and Size Estimation over Joins	2023	PODS	5.6946113e-05
5,150	Efficient Join Synopsis Maintenance for Data Warehouse	2020	SIGMOD	5.6626586e-05
6,740	Combining Aggregation and Sampling (Nearly) Optimally for Approximate Query Processing	2021	SIGMOD	4.944395e-05
7,166	Ranked Enumeration of Join Queries with Projections	2022	VLDB	4.8124491e-05
7,195	Towards Tractability of the Diversity of Query Answers: Ultrametrics to the Rescue	2024	PODS	4.8037242e-05
8,919	Efficient Indexes for Diverse Top-k Range Queries	2020	PODS	4.427232e-05
10,924	Improved Approximation Algorithms for Relational Clustering	2024	PODS	4.1945683e-05
10,961	Faster Algorithms for Fair Max-Min Diversification in Rd	2024	SIGMOD	4.1945683e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
3,715	Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries	2020	VLDB	6.8220943e-05
3,991	Beyond Simple Aggregates: Indexing for Summary Queries	2011	PODS	6.5553055e-05
11,901	Compact Summaries over Large Datasets	2015	PODS	4.1945683e-05
4,056	On the Complexity of Query Result Diversification	2013	VLDB	6.4883623e-05
1,510	Summarizing Relational Databases	2009	VLDB	0.00011606901
8,061	Efficient Computation of Quantiles over Joins	2023	PODS	4.5943269e-05
3,310	Optimal and Approximate Computation of Summary Statistics for Range Aggregates	2001	PODS	7.2408955e-05
8,605	Structure-Aware Sampling: Flexible and Accurate Summarization	2011	VLDB	4.4865144e-05
8,851	Efficient Approximations of Conjunctive Queries	2012	PODS	4.4363908e-05
10,924	Improved Approximation Algorithms for Relational Clustering	2024	PODS	4.1945683e-05