Database Paper Browser

Back to papers

Generating Low-cost Plans From Proofs

Summary: Reduce plan search to proof search: map proofs of query answerability (via interpolation) to restricted-interface access plans, exploiting integrity constraints and TGDs to answer queries without direct relation access. Provide algorithms to generate and cost-optimize alternative proof-derived plans, generalizing preservation/interpolation links in reformulation problems. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1626
Venue
PODS
Year
2014
Pagerank
4.6931334e-05
Overall Rank
7,626 | 46.95%
DOI
10.1145/2594538.2594550

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank Citing Paper Year Venue Pagerank
2,936 Querying with Access Patterns and Integrity Constraints 2015 VLDB 7.8554347e-05
8,259 PDQ: Proof-driven Query Answering over Web-based Data 2014 VLDB 4.5486275e-05
11,672 Block as a Value for SQL over NoSQL 2019 VLDB 4.1945683e-05
11,828 Designing a Query Language for RDF: Marrying Open and Closed Worlds 2016 PODS 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 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