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)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Christoph Berkholz (Humboldt University of Berlin)
- 2. Hubie Chen (Birkbeck, University of London)
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
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 7,904 | Tight Bounds of Circuits for Sum-Product Queries | 2024 | PODS |
| 2 | 11,135 | Query Optimization by Quantifier Elimination | 2024 | PODS |
| 3 | 10,148 | Size Bound-Adorned Datalog | 2026 | PODS |
| 4 | 6,785 | Expressiveness of Guarded Existential Rule Languages | 2014 | PODS |
| 5 | 4,266 | Counting Answers to Existential Positive Queries: A Complexity Classification | 2016 | PODS |
| 6 | 633 | The Complexity of Querying Indefinite Data about Linearly Ordered Domains (Preliminary Version) | 1992 | PODS |
| 7 | 7,679 | Space Optimization in the Bottom-Up Evaluation of Logic Programs | 1991 | SIGMOD |
| 8 | 12,989 | The Size of a Revised Knowledge Base | 1995 | PODS |
| 9 | 6,613 | Inherent Complexity of Recursive Queries (Extended Abstract) | 1999 | PODS |
| 10 | 14,423 | Expressibility of Bounded-Arity Fixed-Point Query Hierarchies | 1989 | PODS |