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
Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,728 | Conjunctive Queries with Comparisons | 2022 | SIGMOD | 5.350072e-05 |
| 7,165 | Ranked Enumeration of Join Queries with Projections | 2022 | VLDB | 4.807833e-05 |
| 8,065 | Efficient Computation of Quantiles over Joins | 2023 | PODS | 4.5899218e-05 |
| 9,743 | Output-Sensitive Evaluation of Regular Path Queries | 2025 | PODS | 4.2856385e-05 |
| 9,940 | Worst-Case-Optimal Similarity Joins on Graph Databases | 2024 | SIGMOD | 4.241573e-05 |
| 9,985 | Database Research needs an Abstract Relational Query Language | 2026 | CIDR | 4.1905499e-05 |
| 10,930 | Complex Event Recognition meets Hierarchical Conjunctive Queries | 2024 | PODS | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 34 of 34 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 | Pagerank |
|---|---|---|---|---|
| 4,926 | On Join Sampling and the Hardness of Combinatorial Output-Sensitive Join Algorithms | 2023 | PODS | 5.8184457e-05 |
| 6,732 | Conjunctive Queries With Self-Joins, Towards a Fine-Grained Enumeration Complexity Analysis | 2023 | PODS | 4.9435849e-05 |
| 8,972 | Output-sensitive Conjunctive Query Evaluation | 2024 | PODS | 4.4150824e-05 |
| 12,199 | Efficient Rank Join with Aggregation Constraints | 2011 | VLDB | 4.1905499e-05 |
| 551 | Supporting Incremental Join Queries on Ranked Inputs | 2001 | VLDB | 0.00020310856 |
| 3,386 | Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration | 2020 | PODS | 7.151562e-05 |
| 8,065 | Efficient Computation of Quantiles over Joins | 2023 | PODS | 4.5899218e-05 |
| 10,336 | Towards Efficient Random-Order Enumeration for Join Queries | 2026 | VLDB | 4.1905499e-05 |
| 3,702 | Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries | 2020 | VLDB | 6.8251643e-05 |
| 7,165 | Ranked Enumeration of Join Queries with Projections | 2022 | VLDB | 4.807833e-05 |