Tight Fine-Grained Bounds for Direct Access on Join Queries
Summary: Decomposition-based algorithm that achieves the minimal preprocessing needed to support polylogarithmic lexicographic direct access for every self-join-free query and lexicographic order. Matching lower bounds via online Set-Disjointness reductions from the Zero-Clique conjecture, with consequences ruling out subtrivial preprocessing for Loomis–Whitney and supporting enumeration hardness for cyclic self-join-free joins. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Karl Bringmann
- 2. Nofar Carmeli
- 3. Stefan Mengel
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,031 | Extending SQL to Return a Subdatabase | 2025 | SIGMOD | 4.4039656e-05 |
| 10,905 | Tight Bounds of Circuits for Sum-Product Queries | 2024 | PODS | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 502 | Worst-case Optimal Join Algorithms | 2012 | PODS | 0.00021526612 |
| 3,387 | Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration | 2020 | PODS | 7.1573735e-05 |
| 5,858 | Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries | 2021 | PODS | 5.2997454e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,194 | On the Complexity of Approximate Query Optimization | 2002 | PODS | 6.3697822e-05 |
| 8,851 | Efficient Approximations of Conjunctive Queries | 2012 | PODS | 4.4363908e-05 |
| 5,962 | Beyond Equi-joins: Ranking, Enumeration and Factorization | 2021 | VLDB | 5.2536266e-05 |
| 772 | Answering Conjunctive Queries under Updates | 2017 | PODS | 0.00016876498 |
| 502 | Worst-case Optimal Join Algorithms | 2012 | PODS | 0.00021526612 |
| 8,061 | Efficient Computation of Quantiles over Joins | 2023 | PODS | 4.5943269e-05 |
| 9,707 | Towards Update-Dependent Analysis of Query Maintenance | 2025 | PODS | 4.299267e-05 |
| 4,953 | On Join Sampling and the Hardness of Combinatorial Output-Sensitive Join Algorithms | 2023 | PODS | 5.8085795e-05 |
| 5,858 | Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries | 2021 | PODS | 5.2997454e-05 |
| 6,728 | Conjunctive Queries With Self-Joins, Towards a Fine-Grained Enumeration Complexity Analysis | 2023 | PODS | 4.9483326e-05 |