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.4369578e-05
Overall Rank
4,745 | 68.11%
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.0010679903
111 Optimizing Multi-Feature Queries for Image Databases 2000 VLDB 0.00032668973
172 Combining Fuzzy Information from Multiple Systems 1996 PODS 0.00026824625
208 EmptyHeaded: A Relational Engine for Graph Processing 2016 SIGMOD 0.00024899872
315 Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems 2018 PODS 0.00021236408
357 FAQ: Questions Asked Frequently 2016 PODS 0.00020013731
402 Worst-case Optimal Join Algorithms 2012 PODS 0.00019095982
413 Fuzzy Queries in Multimedia Database Systems 1998 PODS 0.00018686769
507 Supporting Incremental Join Queries on Ranked Inputs 2001 VLDB 0.00017093562
521 Learning Linear Regression Models over Factorized Joins 2016 SIGMOD 0.00016923519
524 Supporting Top-k Join Queries in Relational Databases 2003 VLDB 0.00016902116
637 Answering Conjunctive Queries under Updates 2017 PODS 0.00015334386
684 Generalized Hypertree Decompositions: NP-Hardness and Tractable Variants 2007 PODS 0.00014791388
731 Learning Generalized Linear Models Over Normalized Data 2015 SIGMOD 0.00014400356
819 Hypertree Decompositions: Questions and Answers 2016 PODS 0.00013660715
849 Aggregation and Ordering in Factorised Databases 2013 VLDB 0.00013498306
1,091 What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another? 2017 PODS 0.00012068611
1,690 Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width 2001 PODS 9.8565419e-05
1,726 Beyond Worst-case Analysis for Joins with Minesweeper 2014 PODS 9.7857214e-05
1,813 Joins via Geometric Resolutions: Worst-case and Beyond 2015 PODS 9.5759542e-05
2,293 FDB: A Query Engine for Factorised Relational Databases 2012 VLDB 8.685044e-05
2,302 On Functional Aggregate Queries with Additive Inequalities 2019 PODS 8.6687541e-05
2,593 Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries 2020 VLDB 8.2429717e-05
2,615 Evaluating Rank Joins with Optimal Cost 2008 PODS 8.2217676e-05
2,978 In-Database Learning with Sparse Tensors 2018 PODS 7.7872011e-05
3,373 F: Regression Models over Factorized Views 2016 VLDB 7.3627128e-05
5,233 Robust and Efficient Algorithms for Rank Join Evaluation 2009 SIGMOD 6.2167391e-05
5,492 Compressed Representations of Conjunctive Query Results 2018 PODS 6.1066968e-05
6,002 Approximate Query Engines: Commercial Challenges and Research Opportunities 2017 SIGMOD 5.9149725e-05
6,745 Computing Join Queries with Functional Dependencies 2016 PODS 5.6890943e-05
7,249 Depth Estimation for Ranking Query Optimization 2007 VLDB 5.5722715e-05
7,621 Processing Top-k Join Queries 2010 VLDB 5.4808989e-05
7,756 Optimal Enumeration: Efficient Top-k Tree Matching 2015 VLDB 5.4570169e-05
8,650 Anytime Approximation in Probabilistic Databases via Scaled Dissociations 2019 SIGMOD 5.2929907e-05
8,809 Geometric Approaches for Top-k Queries 2017 VLDB 5.2711392e-05
Previous Page 1 / 1 Next

Semantically Similar Papers