Database Paper Browser

Back to papers

Bounded Query Rewriting Using Views

Summary: Decide if Q has a bounded rewriting via views V under access constraints A — Q answerable from cached views plus fragment D_Q whose size and lookup are independent of |D|. Results: Σp^3-complete for CQs (even acyclic), undecidable for FO/RA; PTIME cases identified and a PTIME-checkable FO core syntax provided. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1689
Venue
PODS
Year
2016
Pagerank
4.1945683e-05
Overall Rank
11,826 | 17.73%
DOI
10.1145/2902251.2902294

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 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
8,715 Data Driven Approximation with Bounded Resources 2017 VLDB 4.4619052e-05
11,785 BEAS: Bounded Evaluation of SQL Queries 2017 SIGMOD 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 15 of 15 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers