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: h3690e83b399c26f6
Venue: VLDB
Year: 2022
Pagerank: 5.7515992e-05
Overall Rank: 6,545 | 56.00%
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 7 of 7 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
7,513	Computing A Well-Representative Summary of Conjunctive Query Results	2024	PODS	5.5049463e-05
10,370	Faster Relational Algorithms Using Geometric Data Structures	2026	PODS	4.9793485e-05
10,393	Clustering with Set Outliers and Applications in Relational Clustering	2026	PODS	4.9793485e-05
11,027	Instance-Optimal Acyclic Joins: From Theory to Systems	2026	VLDB	4.9793485e-05
11,185	Fast Hypertree Decompositions via Linear Programming: Fractional and Generalized	2025	SIGMOD	4.9793485e-05
11,492	Improved Approximation Algorithms for Relational Clustering	2024	PODS	4.9793485e-05
11,526	Relational Algorithms for Top-k Query Evaluation	2024	SIGMOD	4.9793485e-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.0010679641
357	FAQ: Questions Asked Frequently	2016	PODS	0.00020020639
387	The LDBC Social Network Benchmark: Interactive Workload	2015	SIGMOD	0.00019426275
402	Worst-case Optimal Join Algorithms	2012	PODS	0.00019104625
540	An Analytical Study of Large SPARQL Query Logs	2018	VLDB	0.00016726545
702	Database Architecture Evolution: Mammals Flourished long before Dinosaurs became Extinct	2009	VLDB	0.00014673738
849	Aggregation and Ordering in Factorised Databases	2013	VLDB	0.00013504405
961	RankSQL: Query Algebra and Optimization for Relational Top-k Queries	2005	SIGMOD	0.0001282305
1,091	What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another?	2017	PODS	0.00012074152
1,773	Rank-aware Query Optimization	2004	SIGMOD	9.6719067e-05
2,006	IO-Top-k: Index-access Optimized Top-k Query Processing	2006	VLDB	9.199795e-05
2,290	FDB: A Query Engine for Factorised Relational Databases	2012	VLDB	8.6889284e-05
2,591	Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries	2020	VLDB	8.2468757e-05
2,916	Extracting and Analyzing Hidden Graphs from Relational Databases	2017	SIGMOD	7.8583302e-05
3,187	Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries	2020	PODS	7.5546613e-05
5,482	Beyond Equi-joins: Ranking, Enumeration and Factorization	2021	VLDB	6.111411e-05
5,941	RankSQL: Supporting Ranking Queries in Relational Database Management Systems	2005	VLDB	5.940085e-05
7,339	Sum-Max Monotonic Ranked Joins for Evaluating Top-K Twig Queries on Weighted Data Graphs	2007	VLDB	5.5490881e-05
7,752	Optimal Enumeration: Efficient Top-k Tree Matching	2015	VLDB	5.4595236e-05
9,933	Modern Lower Bound Techniques in Database Theory and Constraint Satisfaction	2021	PODS	5.1100666e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	7,615	Processing Top-k Join Queries	2010	VLDB
2	524	Supporting Top-k Join Queries in Relational Databases	2003	VLDB
3	2,757	Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration	2020	PODS
4	12,677	Efficient Rank Join with Aggregation Constraints	2011	VLDB
5	507	Supporting Incremental Join Queries on Ranked Inputs	2001	VLDB
6	1,773	Rank-aware Query Optimization	2004	SIGMOD
7	7,435	Efficient Computation of Quantiles over Joins	2023	PODS
8	5,482	Beyond Equi-joins: Ranking, Enumeration and Factorization	2021	VLDB
9	2,591	Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries	2020	VLDB
10	11,068	Towards Efficient Random-Order Enumeration for Join Queries	2026	VLDB