Database Paper Browser

Back to papers

Optimal Join Algorithms Meet Top-k

Summary: Unifies top-k queries with RAM-based optimal join algorithms, addressing large intermediates and Threshold Algorithm limitations. Surveys intersection of ranked-join enumeration, linking k-shortest path ideas to a unified, efficient top-k framework. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
5830
Venue
SIGMOD
Year
2020
Pagerank
5.3057391e-05
Overall Rank
5,845 | 59.38%
DOI
10.1145/3318464.3383132

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Rank Citing Paper Year Venue Pagerank
494 Milvus: A Purpose-Built Vector Data Management System 2021 SIGMOD 0.00021769407
5,503 Worst-Case Optimal Graph Joins in Almost No Space 2021 SIGMOD 5.4718854e-05
5,859 Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries 2021 PODS 5.2963939e-05
5,963 Beyond Equi-joins: Ranking, Enumeration and Factorization 2021 VLDB 5.2485815e-05
7,845 Progressive Join Algorithms Considering User Preference 2021 CIDR 4.6327267e-05
10,973 Relational Algorithms for Top-k Query Evaluation 2024 SIGMOD 4.1905499e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 32 of 32 cited papers.

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

Rank Cited Paper Year Venue Pagerank
8 Optimal Aggregation Algorithms for Middleware [Extended Abstract] 2001 PODS 0.0015436578
17 Optimizing Multi-Feature Queries for Image Databases 2000 VLDB 0.00095799341
72 Combining Fuzzy Information from Multiple Systems 1996 PODS 0.00058498396
171 Fuzzy Queries in Multimedia Database Systems 1998 PODS 0.00038843975
341 EmptyHeaded: A Relational Engine for Graph Processing 2016 SIGMOD 0.00026850764
503 Worst-case Optimal Join Algorithms 2012 PODS 0.00021517145
551 Supporting Incremental Join Queries on Ranked Inputs 2001 VLDB 0.00020310856
564 FAQ: Questions Asked Frequently 2016 PODS 0.00020002796
623 Generalized Hypertree Decompositions: NP-Hardness and Tractable Variants 2007 PODS 0.00018976192
673 Supporting Top-k Join Queries in Relational Databases 2003 VLDB 0.00018325667
770 Answering Conjunctive Queries under Updates 2017 PODS 0.0001686092
832 Learning Linear Regression Models over Factorized Joins 2016 SIGMOD 0.00016089705
1,172 Learning Generalized Linear Models Over Normalized Data 2015 SIGMOD 0.00013504249
1,255 Aggregation and Ordering in Factorised Databases 2013 VLDB 0.00013011216
1,322 Hypertree Decompositions: Questions and Answers 2016 PODS 0.00012595941
1,452 What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another? 2017 PODS 0.00011922523
1,556 Beyond Worst-case Analysis for Joins with Minesweeper 2014 PODS 0.00011383141
2,007 Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width 2001 PODS 9.8123766e-05
2,298 Joins via Geometric Resolutions: Worst-case and Beyond 2015 PODS 9.0746479e-05
2,965 Evaluating Rank Joins with Optimal Cost 2008 PODS 7.8049517e-05
3,009 On Functional Aggregate Queries with Additive Inequalities 2019 PODS 7.7230513e-05
3,088 FDB: A Query Engine for Factorised Relational Databases 2012 VLDB 7.5940302e-05
3,702 Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries 2020 VLDB 6.8251643e-05
4,195 F: Regression Models over Factorized Views 2016 VLDB 6.3635322e-05
5,379 Robust and Efficient Algorithms for Rank Join Evaluation 2009 SIGMOD 5.5375923e-05
6,402 Approximate Query Engines: Commercial Challenges and Research Opportunities 2017 SIGMOD 5.0725227e-05
6,822 Computing Join Queries with Functional Dependencies 2016 PODS 4.9101655e-05
6,826 Depth Estimation for Ranking Query Optimization 2007 VLDB 4.9090969e-05
7,660 Processing Top-k Join Queries 2010 VLDB 4.6814547e-05
7,761 Optimal Enumeration: Efficient Top-k Tree Matching 2015 VLDB 4.6543114e-05
8,578 Anytime Approximation in Probabilistic Databases via Scaled Dissociations 2019 SIGMOD 4.4879347e-05
8,581 Geometric Approaches for Top-k Queries 2017 VLDB 4.4874332e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
8,149 Efficiently Computing Join Orders with Heuristic Search 2023 SIGMOD 4.5715614e-05
3,911 Progressive and Selective Merge: Computing Top-K with Ad-hoc Ranking Functions 2007 SIGMOD 6.6343292e-05
1,621 Adaptive Optimization of Very Large Join Queries 2018 SIGMOD 0.00011105663
2,053 Optimal Top-Down Join Enumeration 2007 SIGMOD 9.682841e-05
12,119 Optimal Top-k Generation of Attribute Combinations based on Ranked Lists 2012 SIGMOD 4.1905499e-05
3,702 Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries 2020 VLDB 6.8251643e-05
673 Supporting Top-k Join Queries in Relational Databases 2003 VLDB 0.00018325667
2,281 Adopting Worst-Case Optimal Joins in Relational Database Systems 2020 VLDB 9.122455e-05
2,965 Evaluating Rank Joins with Optimal Cost 2008 PODS 7.8049517e-05
7,660 Processing Top-k Join Queries 2010 VLDB 4.6814547e-05