DBScholar

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
4875
Venue
SIGMOD
Year
2014
Pagerank
7.4515019e-05
Overall Rank
3,392 | 76.73%
DOI
10.1145/2588555.2593683

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{ileana_sigmod14,
        title = {{Complete Yet Practical Search for Minimal Query Reformulations Under Constraints}},
        author = {Ileana, Ioana and Cautis, Bogdan and Deutsch, Alin and Katsis, Yannis},
        series = {{SIGMOD} '14},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/2588555.2593683},
        url = {https://dl.acm.org/doi/10.1145/2588555.2593683},
        year = {2014}
}

Incoming Citations (Sorted by Pagerank)

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