DBScholar

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
5891
Venue
SIGMOD
Year
2020
Pagerank
6.1540123e-05
Overall Rank
5,601 | 61.58%
DOI
10.1145/3318464.3383132

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{tziavelis_sigmod20,
        title = {{Optimal Join Algorithms Meet Top-k}},
        author = {Tziavelis, Nikolaos and Gatterbauer, Wolfgang and Riedewald, Mirek},
        series = {{SIGMOD} '20},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3318464.3383132},
        url = {https://dl.acm.org/doi/10.1145/3318464.3383132},
        year = {2020}
}

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Rank Citing Paper Year Venue Pagerank
286 Milvus: A Purpose-Built Vector Data Management System 2021 SIGMOD 0.00022357911
4,753 Worst-Case Optimal Graph Joins in Almost No Space 2021 SIGMOD 6.5231863e-05
4,781 Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries 2021 PODS 6.5116536e-05
5,593 Beyond Equi-joins: Ranking, Enumeration and Factorization 2021 VLDB 6.1552328e-05
8,024 Progressive Join Algorithms Considering User Preference 2021 CIDR 5.5052493e-05
11,183 Relational Algorithms for Top-k Query Evaluation 2024 SIGMOD 5.093636e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 35 of 35 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
108 Optimizing Multi-Feature Queries for Image Databases 2000 VLDB 0.00033228866
170 Combining Fuzzy Information from Multiple Systems 1996 PODS 0.00027376361
211 EmptyHeaded: A Relational Engine for Graph Processing 2016 SIGMOD 0.00024797217
321 Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems 2018 PODS 0.00021283186
358 FAQ: Questions Asked Frequently 2016 PODS 0.00020243592
402 Fuzzy Queries in Multimedia Database Systems 1998 PODS 0.00019072958
411 Worst-case Optimal Join Algorithms 2012 PODS 0.00018902089
499 Supporting Incremental Join Queries on Ranked Inputs 2001 VLDB 0.00017431827
509 Supporting Top-k Join Queries in Relational Databases 2003 VLDB 0.00017220967
536 Learning Linear Regression Models over Factorized Joins 2016 SIGMOD 0.0001693369
636 Answering Conjunctive Queries under Updates 2017 PODS 0.0001551856
673 Generalized Hypertree Decompositions: NP-Hardness and Tractable Variants 2007 PODS 0.00015095061
715 Learning Generalized Linear Models Over Normalized Data 2015 SIGMOD 0.00014655327
814 Hypertree Decompositions: Questions and Answers 2016 PODS 0.00013841737
860 Aggregation and Ordering in Factorised Databases 2013 VLDB 0.00013560445
1,109 What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another? 2017 PODS 0.00012142685
1,673 Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width 2001 PODS 0.00010040854
1,699 Beyond Worst-case Analysis for Joins with Minesweeper 2014 PODS 9.975915e-05
1,857 Joins via Geometric Resolutions: Worst-case and Beyond 2015 PODS 9.6047945e-05
2,266 On Functional Aggregate Queries with Additive Inequalities 2019 PODS 8.8391372e-05
2,392 FDB: A Query Engine for Factorised Relational Databases 2012 VLDB 8.6404947e-05
2,585 Evaluating Rank Joins with Optimal Cost 2008 PODS 8.3774452e-05
2,745 Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries 2020 VLDB 8.1747954e-05
2,927 In-Database Learning with Sparse Tensors 2018 PODS 7.9531195e-05
3,334 F: Regression Models over Factorized Views 2016 VLDB 7.5110164e-05
5,138 Robust and Efficient Algorithms for Rank Join Evaluation 2009 SIGMOD 6.3495536e-05
5,383 Compressed Representations of Conjunctive Query Results 2018 PODS 6.2374576e-05
5,906 Approximate Query Engines: Commercial Challenges and Research Opportunities 2017 SIGMOD 6.0457047e-05
6,672 Computing Join Queries with Functional Dependencies 2016 PODS 5.8070233e-05
7,123 Depth Estimation for Ranking Query Optimization 2007 VLDB 5.6966694e-05
7,550 Processing Top-k Join Queries 2010 VLDB 5.6011318e-05
7,664 Optimal Enumeration: Efficient Top-k Tree Matching 2015 VLDB 5.5720259e-05
8,476 Anytime Approximation in Probabilistic Databases via Scaled Dissociations 2019 SIGMOD 5.4170414e-05
8,665 Geometric Approaches for Top-k Queries 2017 VLDB 5.3884685e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 3,500 Progressive and Selective Merge: Computing Top-K with Ad-hoc Ranking Functions 2007 SIGMOD
2 1,286 Adaptive Optimization of Very Large Join Queries 2018 SIGMOD
3 1,727 Optimal Top-Down Join Enumeration 2007 SIGMOD
4 12,308 Optimal Top-k Generation of Attribute Combinations based on Ranked Lists 2012 SIGMOD
5 2,745 Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries 2020 VLDB
6 509 Supporting Top-k Join Queries in Relational Databases 2003 VLDB
7 1,740 Adopting Worst-Case Optimal Joins in Relational Database Systems 2020 VLDB
8 321 Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems 2018 PODS
9 2,585 Evaluating Rank Joins with Optimal Cost 2008 PODS
10 7,550 Processing Top-k Join Queries 2010 VLDB