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
5829
Venue
SIGMOD
Year
2020
Pagerank
5.3006096e-05
Overall Rank
5,855 | 59.27%
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
495 Milvus: A Purpose-Built Vector Data Management System 2021 SIGMOD 0.00021767688
5,493 Worst-Case Optimal Graph Joins in Almost No Space 2021 SIGMOD 5.4771449e-05
5,858 Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries 2021 PODS 5.2997454e-05
5,962 Beyond Equi-joins: Ranking, Enumeration and Factorization 2021 VLDB 5.2536266e-05
7,840 Progressive Join Algorithms Considering User Preference 2021 CIDR 4.6371736e-05
10,970 Relational Algorithms for Top-k Query Evaluation 2024 SIGMOD 4.1945683e-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
7 Optimal Aggregation Algorithms for Middleware [Extended Abstract] 2001 PODS 0.0015496097
17 Optimizing Multi-Feature Queries for Image Databases 2000 VLDB 0.00096067547
72 Combining Fuzzy Information from Multiple Systems 1996 PODS 0.00058577335
169 Fuzzy Queries in Multimedia Database Systems 1998 PODS 0.00038895438
342 EmptyHeaded: A Relational Engine for Graph Processing 2016 SIGMOD 0.00026795977
502 Worst-case Optimal Join Algorithms 2012 PODS 0.00021526612
552 Supporting Incremental Join Queries on Ranked Inputs 2001 VLDB 0.00020310903
583 FAQ: Questions Asked Frequently 2016 PODS 0.00019717214
626 Generalized Hypertree Decompositions: NP-Hardness and Tractable Variants 2007 PODS 0.00018973823
674 Supporting Top-k Join Queries in Relational Databases 2003 VLDB 0.00018327585
772 Answering Conjunctive Queries under Updates 2017 PODS 0.00016876498
834 Learning Linear Regression Models over Factorized Joins 2016 SIGMOD 0.00016135159
1,167 Learning Generalized Linear Models Over Normalized Data 2015 SIGMOD 0.00013547713
1,259 Aggregation and Ordering in Factorised Databases 2013 VLDB 0.00012995821
1,328 Hypertree Decompositions: Questions and Answers 2016 PODS 0.00012565612
1,442 What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another? 2017 PODS 0.00011956109
1,557 Beyond Worst-case Analysis for Joins with Minesweeper 2014 PODS 0.00011392493
2,015 Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width 2001 PODS 9.7901938e-05
2,296 Joins via Geometric Resolutions: Worst-case and Beyond 2015 PODS 9.0776226e-05
2,961 Evaluating Rank Joins with Optimal Cost 2008 PODS 7.8110394e-05
3,006 On Functional Aggregate Queries with Additive Inequalities 2019 PODS 7.7299363e-05
3,082 FDB: A Query Engine for Factorised Relational Databases 2012 VLDB 7.6014248e-05
3,715 Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries 2020 VLDB 6.8220943e-05
4,159 F: Regression Models over Factorized Views 2016 VLDB 6.3993326e-05
5,373 Robust and Efficient Algorithms for Rank Join Evaluation 2009 SIGMOD 5.5425231e-05
6,411 Approximate Query Engines: Commercial Challenges and Research Opportunities 2017 SIGMOD 5.0752468e-05
6,824 Computing Join Queries with Functional Dependencies 2016 PODS 4.9144789e-05
6,829 Depth Estimation for Ranking Query Optimization 2007 VLDB 4.9136064e-05
7,692 Processing Top-k Join Queries 2010 VLDB 4.6761366e-05
7,762 Optimal Enumeration: Efficient Top-k Tree Matching 2015 VLDB 4.6583829e-05
8,581 Anytime Approximation in Probabilistic Databases via Scaled Dissociations 2019 SIGMOD 4.492241e-05
8,584 Geometric Approaches for Top-k Queries 2017 VLDB 4.4914121e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
552 Supporting Incremental Join Queries on Ranked Inputs 2001 VLDB 0.00020310903
3,908 Progressive and Selective Merge: Computing Top-K with Ad-hoc Ranking Functions 2007 SIGMOD 6.6392878e-05
1,619 Adaptive Optimization of Very Large Join Queries 2018 SIGMOD 0.00011111678
2,050 Optimal Top-Down Join Enumeration 2007 SIGMOD 9.6886663e-05
12,111 Optimal Top-k Generation of Attribute Combinations based on Ranked Lists 2012 SIGMOD 4.1945683e-05
3,715 Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries 2020 VLDB 6.8220943e-05
674 Supporting Top-k Join Queries in Relational Databases 2003 VLDB 0.00018327585
2,275 Adopting Worst-Case Optimal Joins in Relational Database Systems 2020 VLDB 9.1262202e-05
2,961 Evaluating Rank Joins with Optimal Cost 2008 PODS 7.8110394e-05
7,692 Processing Top-k Join Queries 2010 VLDB 4.6761366e-05