Database Paper Browser

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
1755
Venue
PODS
Year
2019
Pagerank
4.1945683e-05
Overall Rank
11,644 | 19.00%
DOI
10.1145/3294052.3319693

Incoming Non-self Citations Over Time

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

Authors

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
602 On the Complexity of Bounded-Variable Queries 1995 PODS 0.00019352415
3,003 Counting Answers to Existential Positive Queries: A Complexity Classification 2016 PODS 7.7388586e-05
Previous Page 1 / 1 Next

Semantically Similar Papers