DBScholar

Back to papers

Counting Answers to Existential Positive Queries: A Complexity Classification

Summary: Trichotomy for counting answers to bounded-arity existential positive (EP) formulas: every EP query class falls into one of three complexity regimes, subsuming known CQ/UCQ results. Novel equivalence theorem maps each EP class to a CQ class with identical counting complexity. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1673
Venue
PODS
Year
2016
Pagerank
6.7936492e-05
Overall Rank
4,266 | 70.74%
DOI
10.1145/2902251.2902279

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{chen_pods16,
        address = {New York, NY, USA},
        series = {{PODS} '16},
        title = {{Counting Answers to Existential Positive Queries: A Complexity Classification}},
        url = {https://dl.acm.org/doi/10.1145/2902251.2902279},
        doi = {10.1145/2902251.2902279},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Chen, Hubie and Mengel, Stefan},
        year = {2016}
}

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
414 On the Complexity of Database Queries (Extended Abstract) 1997 PODS 0.00018893507
2,448 Counting Solutions to Conjunctive Queries: Structural and Hybrid Tractability 2014 PODS 8.5693075e-05
Previous Page 1 / 1 Next

Semantically Similar Papers