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
hdbac817c69460ef6
Venue
SIGMOD
Year
2020
Pagerank
6.434561e-05
Overall Rank
4,752 | 68.06%
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 9 of 9 citing papers.

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.0010679641
111 Optimizing Multi-Feature Queries for Image Databases 2000 VLDB 0.00032675259
172 Combining Fuzzy Information from Multiple Systems 1996 PODS 0.00026835705
208 EmptyHeaded: A Relational Engine for Graph Processing 2016 SIGMOD 0.00024884544
315 Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems 2018 PODS 0.00021246
357 FAQ: Questions Asked Frequently 2016 PODS 0.00020020639
402 Worst-case Optimal Join Algorithms 2012 PODS 0.00019104625
412 Fuzzy Queries in Multimedia Database Systems 1998 PODS 0.00018694414
507 Supporting Incremental Join Queries on Ranked Inputs 2001 VLDB 0.00017101297
521 Learning Linear Regression Models over Factorized Joins 2016 SIGMOD 0.00016929744
524 Supporting Top-k Join Queries in Relational Databases 2003 VLDB 0.00016909926
637 Answering Conjunctive Queries under Updates 2017 PODS 0.00015341557
684 Generalized Hypertree Decompositions: NP-Hardness and Tractable Variants 2007 PODS 0.00014798237
730 Learning Generalized Linear Models Over Normalized Data 2015 SIGMOD 0.00014406936
818 Hypertree Decompositions: Questions and Answers 2016 PODS 0.0001366708
849 Aggregation and Ordering in Factorised Databases 2013 VLDB 0.00013504405
1,091 What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another? 2017 PODS 0.00012074152
1,690 Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width 2001 PODS 9.8609347e-05
1,725 Beyond Worst-case Analysis for Joins with Minesweeper 2014 PODS 9.7902443e-05
1,812 Joins via Geometric Resolutions: Worst-case and Beyond 2015 PODS 9.5803973e-05
2,290 FDB: A Query Engine for Factorised Relational Databases 2012 VLDB 8.6889284e-05
2,299 On Functional Aggregate Queries with Additive Inequalities 2019 PODS 8.6727773e-05
2,591 Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries 2020 VLDB 8.2468757e-05
2,614 Evaluating Rank Joins with Optimal Cost 2008 PODS 8.2255837e-05
2,975 In-Database Learning with Sparse Tensors 2018 PODS 7.7907759e-05
3,373 F: Regression Models over Factorized Views 2016 VLDB 7.3661025e-05
5,229 Robust and Efficient Algorithms for Rank Join Evaluation 2009 SIGMOD 6.2196057e-05
5,489 Compressed Representations of Conjunctive Query Results 2018 PODS 6.1095111e-05
6,004 Approximate Query Engines: Commercial Challenges and Research Opportunities 2017 SIGMOD 5.9166815e-05
6,739 Computing Join Queries with Functional Dependencies 2016 PODS 5.6917027e-05
7,247 Depth Estimation for Ranking Query Optimization 2007 VLDB 5.5748328e-05
7,615 Processing Top-k Join Queries 2010 VLDB 5.4834169e-05
7,752 Optimal Enumeration: Efficient Top-k Tree Matching 2015 VLDB 5.4595236e-05
8,643 Anytime Approximation in Probabilistic Databases via Scaled Dissociations 2019 SIGMOD 5.2954976e-05
8,801 Geometric Approaches for Top-k Queries 2017 VLDB 5.2735579e-05
Previous Page 1 / 1 Next

Semantically Similar Papers