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
- 2. Shai Zeevi
- 3. Christoph Berkholz
- 4. Benny Kimelfeld
- 5. Nicole Schweikardt
Incoming Citations (Sorted by Pagerank)
Showing 14 of 14 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 |
|---|---|---|---|---|
| 18 | On Random Sampling over Joins | 1999 | SIGMOD | 0.00092385438 |
| 54 | DISCOVER: Keyword Search in Relational Databases | 2002 | VLDB | 0.00066047203 |
| 211 | Join Synopses for Approximate Query Answering | 1999 | SIGMOD | 0.00033981214 |
| 217 | Ripple Joins for Online Aggregation | 1999 | SIGMOD | 0.00033536712 |
| 1,056 | The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates | 2017 | SIGMOD | 0.0001441128 |
| 1,369 | Random Sampling over Joins Revisited | 2018 | SIGMOD | 0.00012339777 |
| 1,453 | Keyword Proximity Search in Complex Data Graphs | 2008 | SIGMOD | 0.00011917976 |
| 3,371 | On the Enumeration Complexity of Unions of Conjunctive Queries | 2019 | PODS | 7.1696145e-05 |
| 3,715 | Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries | 2020 | VLDB | 6.8220943e-05 |
Previous
Page 1 / 1
Next