Fine-Grained Dichotomies for Conjunctive Queries with Minimum or Maximum
Summary: Develops fine-grained dichotomies for direct access and ranked enumeration of self-join-free CQ answers under min/max orders. Extends the classification to counting, enumeration, direct access, and predicate elimination for x ≤ min X, identifying exactly when near-ideal preprocessing and delay are possible. (summarized by gpt-5.6-luna on Jul 26 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Nofar Carmeli (INRIA; Laboratory of Computer Science, Robotics and Microelectronics of Montpellier; National Centre for Scientific Research; University of Montpellier)
- 2. Nikolaos Tziavelis (University of California Santa Cruz)
BibTeX Citation
@inproceedings{carmeli_pods26,
address = {New York, NY, USA},
series = {{PODS} '26},
title = {{Fine-Grained Dichotomies for Conjunctive Queries with Minimum or Maximum}},
url = {https://dl.acm.org/doi/10.1145/3801899},
doi = {10.1145/3801899},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Carmeli, Nofar and Tziavelis, Nikolaos},
year = {2026}
}
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 12 of 12 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 |
|---|---|---|---|---|
| 1 | 5,593 | Beyond Equi-joins: Ranking, Enumeration and Factorization | 2021 | VLDB |
| 2 | 12,229 | The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space Complexity | 2013 | PODS |
| 3 | 10,020 | Conjunctive Queries with Negation and Aggregation: A Linear Time Characterization | 2024 | PODS |
| 4 | 8,673 | Fine-Grained Complexity Analysis of Queries: From Decision to Counting and Enumeration | 2020 | PODS |
| 5 | 2,468 | On the Enumeration Complexity of Unions of Conjunctive Queries | 2019 | PODS |
| 6 | 2,745 | Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries | 2020 | VLDB |
| 7 | 8,047 | Tight Fine-Grained Bounds for Direct Access on Join Queries | 2022 | PODS |
| 8 | 7,286 | Efficient Computation of Quantiles over Joins | 2023 | PODS |
| 9 | 5,854 | Conjunctive Queries With Self-Joins, Towards a Fine-Grained Enumeration Complexity Analysis | 2023 | PODS |
| 10 | 4,781 | Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries | 2021 | PODS |