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.7298671e-05
Overall Rank: 6,557 | 56.05%
DOI: 10.14778/3510397.3510401
PDF: Download (CC BY-NC-ND 4.0)

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,537	Computing A Well-Representative Summary of Conjunctive Query Results	2024	PODS	5.4841462e-05
10,448	Faster Relational Algorithms Using Geometric Data Structures	2026	PODS	4.9605343e-05
10,471	Clustering with Set Outliers and Applications in Relational Clustering	2026	PODS	4.9605343e-05
11,097	Instance-Optimal Acyclic Joins: From Theory to Systems	2026	VLDB	4.9605343e-05
11,253	Fast Hypertree Decompositions via Linear Programming: Fractional and Generalized	2025	SIGMOD	4.9605343e-05
11,550	Improved Approximation Algorithms for Relational Clustering	2024	PODS	4.9605343e-05
11,581	Relational Algorithms for Top-k Query Evaluation	2024	SIGMOD	4.9605343e-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.0010688884
357	FAQ: Questions Asked Frequently	2016	PODS	0.00020048899
387	The LDBC Social Network Benchmark: Interactive Workload	2015	SIGMOD	0.00019360364
397	Worst-case Optimal Join Algorithms	2012	PODS	0.0001911958
536	An Analytical Study of Large SPARQL Query Logs	2018	VLDB	0.00016738841
702	Database Architecture Evolution: Mammals Flourished long before Dinosaurs became Extinct	2009	VLDB	0.0001464107
848	Aggregation and Ordering in Factorised Databases	2013	VLDB	0.00013463236
941	RankSQL: Query Algebra and Optimization for Relational Top-k Queries	2005	SIGMOD	0.00012938573
1,096	What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another?	2017	PODS	0.00012035761
1,712	Rank-aware Query Optimization	2004	SIGMOD	9.7961248e-05
2,019	IO-Top-k: Index-access Optimized Top-k Query Processing	2006	VLDB	9.1666472e-05
2,298	FDB: A Query Engine for Factorised Relational Databases	2012	VLDB	8.6645337e-05
2,602	Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries	2020	VLDB	8.2157154e-05
2,930	Extracting and Analyzing Hidden Graphs from Relational Databases	2017	SIGMOD	7.8287763e-05
3,199	Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries	2020	PODS	7.5261206e-05
5,506	Beyond Equi-joins: Ranking, Enumeration and Factorization	2021	VLDB	6.0883761e-05
5,954	RankSQL: Supporting Ranking Queries in Relational Database Management Systems	2005	VLDB	5.9176407e-05
7,362	Sum-Max Monotonic Ranked Joins for Evaluating Top-K Twig Queries on Weighted Data Graphs	2007	VLDB	5.5281595e-05
7,769	Optimal Enumeration: Efficient Top-k Tree Matching	2015	VLDB	5.4391973e-05
9,973	Modern Lower Bound Techniques in Database Theory and Constraint Satisfaction	2021	PODS	5.0907585e-05

Semantically Similar Papers

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