DBScholar

Back to papers

Compiling Existential-Positive Queries to Bounded-Variable Fragments

Summary: Analyzes compiling existential-positive FO queries into bounded-variable positive FO, trading variable minimization against formula-size blow-up. Proves an at-most-exponential upper bound, identifies polynomial cases, and gives matching unconditional exponential lower bounds via a novel circuit-complexity connection. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1787
Venue
PODS
Year
2019
Pagerank
5.093636e-05
Overall Rank
11,838 | 18.79%
DOI
10.1145/3294052.3319693

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{berkholz_pods19,
        address = {New York, NY, USA},
        series = {{PODS} '19},
        title = {{Compiling Existential-Positive Queries to Bounded-Variable Fragments}},
        url = {https://dl.acm.org/doi/10.1145/3294052.3319693},
        doi = {10.1145/3294052.3319693},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Berkholz, Christoph and Chen, Hubie},
        year = {2019}
}

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 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
763 On the Complexity of Bounded-Variable Queries 1995 PODS 0.00014230134
4,266 Counting Answers to Existential Positive Queries: A Complexity Classification 2016 PODS 6.7936492e-05
Previous Page 1 / 1 Next

Semantically Similar Papers