DBScholar

Back to papers

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)

Paper ID
2029
Venue
PODS
Year
2026
Pagerank
5.093636e-05
Overall Rank
10,154 | 30.34%
DOI
10.1145/3801899

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

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