Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration
Summary: Free-connex acyclic CQs admit linear preprocessing with polylog-delay enumeration, true random-order enumeration, and polylog random-access, while other CQs (no self-joins) are intractable under fine-grained assumptions. For UCQs the yardsticks separate: unions of free-connex acyclic CQs may be enumerable but lack random-access; paper gives an expected-log-delay random-order enumeration, a UCQ subclass with polylog random-access, and an implementation showing practical gains. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Nofar Carmeli (Technion)
- 2. Shai Zeevi (Technion)
- 3. Christoph Berkholz (Humboldt University of Berlin)
- 4. Benny Kimelfeld (Technion)
- 5. Nicole Schweikardt (Humboldt University of Berlin)
BibTeX Citation
@inproceedings{carmeli_pods20,
address = {New York, NY, USA},
series = {{PODS} '20},
title = {{Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration}},
url = {https://dl.acm.org/doi/10.1145/3375395.3387662},
doi = {10.1145/3375395.3387662},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Carmeli, Nofar and Zeevi, Shai and Berkholz, Christoph and Kimelfeld, Benny and Schweikardt, Nicole},
year = {2020}
}
Incoming Citations (Sorted by Pagerank)
Showing 18 of 18 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 38 | DISCOVER: Keyword Search in Relational Databases | 2002 | VLDB | 0.00047394041 |
| 57 | On Random Sampling over Joins | 1999 | SIGMOD | 0.00040108301 |
| 135 | Ripple Joins for Online Aggregation | 1999 | SIGMOD | 0.00029866033 |
| 138 | Join Synopses for Approximate Query Answering | 1999 | SIGMOD | 0.00029627449 |
| 795 | Random Sampling over Joins Revisited | 2018 | SIGMOD | 0.00013938779 |
| 812 | The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates | 2017 | SIGMOD | 0.00013729015 |
| 1,565 | Keyword Proximity Search in Complex Data Graphs | 2008 | SIGMOD | 0.00010220855 |
| 2,517 | On the Enumeration Complexity of Unions of Conjunctive Queries | 2019 | PODS | 8.3589894e-05 |
| 2,591 | Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries | 2020 | VLDB | 8.2468757e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 637 | Answering Conjunctive Queries under Updates | 2017 | PODS |
| 2 | 7,466 | Probabilistic Query Evaluation: The Combined FPRAS Landscape | 2023 | PODS |
| 3 | 10,371 | Fine-Grained Dichotomies for Conjunctive Queries with Minimum or Maximum | 2026 | PODS |
| 4 | 5,978 | Conjunctive Queries With Self-Joins, Towards a Fine-Grained Enumeration Complexity Analysis | 2023 | PODS |
| 5 | 5,482 | Beyond Equi-joins: Ranking, Enumeration and Factorization | 2021 | VLDB |
| 6 | 6,545 | Ranked Enumeration of Join Queries with Projections | 2022 | VLDB |
| 7 | 4,698 | Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries | 2021 | PODS |
| 8 | 2,591 | Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries | 2020 | VLDB |
| 9 | 2,517 | On the Enumeration Complexity of Unions of Conjunctive Queries | 2019 | PODS |
| 10 | 11,068 | Towards Efficient Random-Order Enumeration for Join Queries | 2026 | VLDB |