Beyond Equi-joins: Ranking, Enumeration and Factorization
Summary: Ranked theta-join enumeration with inequalities; top-k on acyclic full joins in O(n polylog n + k log k). On-the-fly factorized output representation; memory-efficient, fast; experiments show orders-of-magnitude speedups over state-of-the-art DB systems. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Nikolaos Tziavelis (Northeastern University)
- 2. Wolfgang Gatterbauer (Northeastern University)
- 3. Mirek Riedewald (Northeastern University)
BibTeX Citation
@article{tziavelis_vldb21,
title = {{Beyond Equi-joins: Ranking, Enumeration and Factorization}},
author = {Tziavelis, Nikolaos and Gatterbauer, Wolfgang and Riedewald, Mirek},
journal = {PVLDB},
series = {{VLDB} '21},
volume = {14},
number = {11},
pages = {2599--2612},
doi = {10.14778/3476249.3476306},
url = {https://doi.org/10.14778/3476249.3476306},
year = {2021}
}
Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,575 | Conjunctive Queries with Comparisons | 2022 | SIGMOD | 6.6223692e-05 |
| 6,412 | Ranked Enumeration of Join Queries with Projections | 2022 | VLDB | 5.8836116e-05 |
| 7,286 | Efficient Computation of Quantiles over Joins | 2023 | PODS | 5.655242e-05 |
| 9,184 | Complex Event Recognition meets Hierarchical Conjunctive Queries | 2024 | PODS | 5.3058708e-05 |
| 9,235 | Output-Sensitive Evaluation of Regular Path Queries | 2025 | PODS | 5.3016261e-05 |
| 10,087 | Worst-Case-Optimal Similarity Joins on Graph Databases | 2024 | SIGMOD | 5.1558402e-05 |
| 10,133 | Database Research needs an Abstract Relational Query Language | 2026 | CIDR | 5.093636e-05 |
| 10,154 | Fine-Grained Dichotomies for Conjunctive Queries with Minimum or Maximum | 2026 | PODS | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 36 of 36 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,854 | Conjunctive Queries With Self-Joins, Towards a Fine-Grained Enumeration Complexity Analysis | 2023 | PODS |
| 2 | 10,154 | Fine-Grained Dichotomies for Conjunctive Queries with Minimum or Maximum | 2026 | PODS |
| 3 | 6,678 | Output-sensitive Conjunctive Query Evaluation | 2024 | PODS |
| 4 | 12,386 | Efficient Rank Join with Aggregation Constraints | 2011 | VLDB |
| 5 | 499 | Supporting Incremental Join Queries on Ranked Inputs | 2001 | VLDB |
| 6 | 2,777 | Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration | 2020 | PODS |
| 7 | 7,286 | Efficient Computation of Quantiles over Joins | 2023 | PODS |
| 8 | 10,622 | Towards Efficient Random-Order Enumeration for Join Queries | 2026 | VLDB |
| 9 | 2,745 | Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries | 2020 | VLDB |
| 10 | 6,412 | Ranked Enumeration of Join Queries with Projections | 2022 | VLDB |