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
- 2. Hubie Chen
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 |
|---|---|---|---|---|
| 603 | On the Complexity of Bounded-Variable Queries | 1995 | PODS | 0.00019334592 |
| 3,005 | Counting Answers to Existential Positive Queries: A Complexity Classification | 2016 | PODS | 7.7315492e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 603 | On the Complexity of Bounded-Variable Queries | 1995 | PODS | 0.00019334592 |
| 10,909 | Tight Bounds of Circuits for Sum-Product Queries | 2024 | PODS | 4.1905499e-05 |
| 10,918 | Query Optimization by Quantifier Elimination | 2024 | PODS | 4.1905499e-05 |
| 7,959 | Expressiveness of Guarded Existential Rule Languages | 2014 | PODS | 4.6089395e-05 |
| 3,005 | Counting Answers to Existential Positive Queries: A Complexity Classification | 2016 | PODS | 7.7315492e-05 |
| 582 | The Complexity of Querying Indefinite Data about Linearly Ordered Domains (Preliminary Version) | 1992 | PODS | 0.00019753367 |
| 7,085 | Space Optimization in the Bottom-Up Evaluation of Logic Programs | 1991 | SIGMOD | 4.8325254e-05 |
| 12,804 | The Size of a Revised Knowledge Base | 1995 | PODS | 4.1905499e-05 |
| 6,234 | Inherent Complexity of Recursive Queries (Extended Abstract) | 1999 | PODS | 5.1387584e-05 |
| 14,237 | Expressibility of Bounded-Arity Fixed-Point Query Hierarchies | 1989 | PODS | - |