Ranked Enumeration of Join Queries with Projections

Summary: Ranked enumeration with projections for join queries; enables ORDER BY with LIMIT. Acyclic queries achieve near-linear delay after preprocessing; star queries allow preprocessing–latency tradeoff; extensible to cycles and unions; experiments show up to 1,000x speedups. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 12803
Venue: VLDB
Year: 2022
Pagerank: 5.8836116e-05
Overall Rank: 6,412 | 56.01%
DOI: 10.14778/3510397.3510401

Incoming Non-self Citations Over Time

Authors

1. Shaleen Deep (University of Wisconsin)
2. Xiao Hu (Duke University)
3. Paraschos Koutris (University of Wisconsin)

BibTeX Citation

@article{deep_vldb22,
        title = {{Ranked Enumeration of Join Queries with Projections}},
        author = {Deep, Shaleen and Hu, Xiao and Koutris, Paraschos},
        journal = {PVLDB},
        series = {{VLDB} '22},
        volume = {15},
        number = {5},
        pages = {1024--1037},
        doi = {10.14778/3510397.3510401},
        url = {https://doi.org/10.14778/3510397.3510401},
        year = {2022}
}

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
8,728	Computing A Well-Representative Summary of Conjunctive Query Results	2024	PODS	5.3766157e-05
10,153	Faster Relational Algorithms Using Geometric Data Structures	2026	PODS	5.093636e-05
10,176	Clustering with Set Outliers and Applications in Relational Clustering	2026	PODS	5.093636e-05
10,762	Fast Hypertree Decompositions via Linear Programming: Fractional and Generalized	2025	SIGMOD	5.093636e-05
11,144	Improved Approximation Algorithms for Relational Clustering	2024	PODS	5.093636e-05
11,183	Relational Algorithms for Top-k Query Evaluation	2024	SIGMOD	5.093636e-05

Outgoing Citations (Sorted by Pagerank)

Showing 20 of 20 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
5	Optimal Aggregation Algorithms for Middleware [Extended Abstract]	2001	PODS	0.0010828372
358	FAQ: Questions Asked Frequently	2016	PODS	0.00020243592
411	Worst-case Optimal Join Algorithms	2012	PODS	0.00018902089
426	The LDBC Social Network Benchmark: Interactive Workload	2015	SIGMOD	0.00018692185
530	An Analytical Study of Large SPARQL Query Logs	2018	VLDB	0.0001709169
721	Database Architecture Evolution: Mammals Flourished long before Dinosaurs became Extinct	2009	VLDB	0.00014631814
860	Aggregation and Ordering in Factorised Databases	2013	VLDB	0.00013560445
973	RankSQL: Query Algebra and Optimization for Relational Top-k Queries	2005	SIGMOD	0.00012874284
1,109	What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another?	2017	PODS	0.00012142685
1,759	Rank-aware Query Optimization	2004	SIGMOD	9.8160244e-05
1,967	IO-Top-k: Index-access Optimized Top-k Query Processing	2006	VLDB	9.3804693e-05
2,392	FDB: A Query Engine for Factorised Relational Databases	2012	VLDB	8.6404947e-05
2,745	Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries	2020	VLDB	8.1747954e-05
2,854	Extracting and Analyzing Hidden Graphs from Relational Databases	2017	SIGMOD	8.0350257e-05
3,136	Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries	2020	PODS	7.7210541e-05
5,593	Beyond Equi-joins: Ranking, Enumeration and Factorization	2021	VLDB	6.1552328e-05
5,862	RankSQL: Supporting Ranking Queries in Relational Database Management Systems	2005	VLDB	6.0635561e-05
7,202	Sum-Max Monotonic Ranked Joins for Evaluating Top-K Twig Queries on Weighted Data Graphs	2007	VLDB	5.6755422e-05
7,664	Optimal Enumeration: Efficient Top-k Tree Matching	2015	VLDB	5.5720259e-05
9,755	Modern Lower Bound Techniques in Database Theory and Constraint Satisfaction	2021	PODS	5.2273544e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	7,550	Processing Top-k Join Queries	2010	VLDB
2	509	Supporting Top-k Join Queries in Relational Databases	2003	VLDB
3	12,386	Efficient Rank Join with Aggregation Constraints	2011	VLDB
4	2,777	Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration	2020	PODS
5	499	Supporting Incremental Join Queries on Ranked Inputs	2001	VLDB
6	1,759	Rank-aware Query Optimization	2004	SIGMOD
7	7,286	Efficient Computation of Quantiles over Joins	2023	PODS
8	5,593	Beyond Equi-joins: Ranking, Enumeration and Factorization	2021	VLDB
9	2,745	Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries	2020	VLDB
10	10,622	Towards Efficient Random-Order Enumeration for Join Queries	2026	VLDB