Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries
Summary: Identifies when self-join-free CQs admit quasilinear preprocessing plus O(log n) direct access to the k-th answer: provides a decidable characterization for lexicographic orderings and shows sum-of-weights orders are tractable only in trivial cases. For the selection variant (single-position), gives a quasilinear algorithm for a subclass of full CQs using Frederickson–Johnson selection on sorted matrices and proves matching hardness for the rest. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Nofar Carmeli (Technion)
- 2. Nikolaos Tziavelis (Northeastern University)
- 3. Wolfgang Gatterbauer (Northeastern University)
- 4. Benny Kimelfeld (Technion)
- 5. Mirek Riedewald (Northeastern University)
BibTeX Citation
@inproceedings{carmeli_pods21,
address = {New York, NY, USA},
series = {{PODS} '21},
title = {{Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries}},
url = {https://dl.acm.org/doi/10.1145/3452021.3458331},
doi = {10.1145/3452021.3458331},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Carmeli, Nofar and Tziavelis, Nikolaos and Gatterbauer, Wolfgang and Kimelfeld, Benny and Riedewald, Mirek},
year = {2021}
}Incoming Citations (Sorted by Pagerank)
Showing 12 of 12 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 818 | Hypertree Decompositions: Questions and Answers | 2016 | PODS | 0.0001366708 |
| 2,591 | Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries | 2020 | VLDB | 8.2468757e-05 |
| 2,757 | Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration | 2020 | PODS | 8.0525756e-05 |
| 4,062 | The Complexity of Resilience and Responsibility for Self-Join-Free Conjunctive Queries | 2016 | VLDB | 6.8247395e-05 |
| 4,752 | Optimal Join Algorithms Meet Top-k | 2020 | SIGMOD | 6.434561e-05 |
| 5,340 | Approximate Lifted Inference with Probabilistic Databases | 2015 | VLDB | 6.1731278e-05 |
| 5,994 | A Dichotomy in the Complexity of Deletion Propagation with Functional Dependencies | 2012 | PODS | 5.922611e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 6,545 | Ranked Enumeration of Join Queries with Projections | 2022 | VLDB |
| 2 | 5,482 | Beyond Equi-joins: Ranking, Enumeration and Factorization | 2021 | VLDB |
| 3 | 10,398 | The Space-Time Complexity of Sum-Product Queries | 2026 | PODS |
| 4 | 9,169 | Efficient Approximations of Conjunctive Queries | 2012 | PODS |
| 5 | 8,212 | Tight Fine-Grained Bounds for Direct Access on Join Queries | 2022 | PODS |
| 6 | 2,517 | On the Enumeration Complexity of Unions of Conjunctive Queries | 2019 | PODS |
| 7 | 2,757 | Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration | 2020 | PODS |
| 8 | 2,591 | Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries | 2020 | VLDB |
| 9 | 7,435 | Efficient Computation of Quantiles over Joins | 2023 | PODS |
| 10 | 10,371 | Fine-Grained Dichotomies for Conjunctive Queries with Minimum or Maximum | 2026 | PODS |