Database Paper Browser

Back to papers

Complete Yet Practical Search for Minimal Query Reformulations Under Constraints

Summary: ProvC&B preserves completeness for minimal reformulations by adding provenance to link joins to the universal-plan subqueries. From one provenance-enabled chase, reformulations are read directly, yielding speedups over naive chases and commercial rewrites. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
4814
Venue
SIGMOD
Year
2014
Pagerank
7.0192177e-05
Overall Rank
3,514 | 75.58%
DOI
10.1145/2588555.2593683

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 9 of 9 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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

Overall Rank Paper Year Venue Pagerank
2,870 Pushing Constraint Selections 1992 PODS 7.9840692e-05
6,884 Query Evaluation using Overlapping Views: Completeness and Efficiency 2006 SIGMOD 4.8917858e-05
6,567 Generating Efficient Plans for Queries Using Views 2001 SIGMOD 5.0023017e-05
12,305 Equivalence of SQL Queries In Presence of Embedded Dependencies 2009 PODS 4.1905499e-05
5,696 Exact Cardinality Query Optimization with Bounded Execution Cost 2019 SIGMOD 5.367449e-05
2,942 Querying with Access Patterns and Integrity Constraints 2015 VLDB 7.8464054e-05
6,187 On Provenance Minimization 2011 PODS 5.1611195e-05
2,732 Semantic Query Optimization in the Presence of Types 2010 PODS 8.2137395e-05
2,398 Physical Data Independence, Constraints, and Optimization with Universal Plans 1999 VLDB 8.8871067e-05
4,650 A Chase Too Far? 2000 SIGMOD 6.0169723e-05