DBScholar

Back to papers

Automated Verification of Query Equivalence Using Satisfiability Modulo Theories

Summary: EQUITAS translates SQL with complex predicates and three-valued logic into first-order formulas, using SMT to verify semantic equivalence. It handles more pairs 27× faster than algebraic methods and finds redundancy in 11% of 17,461 MaxCompute queries. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
12011
Venue
VLDB
Year
2019
Pagerank
7.518491e-05
Overall Rank
3,327 | 77.18%
DOI
10.14778/3342263.3342267

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{zhou_vldb19,
        title = {{Automated Verification of Query Equivalence Using Satisfiability Modulo Theories}},
        author = {Zhou, Qi and Arulraj, Joy and Navathe, Shamkant and Harris, William and Xu, Dong},
        journal = {PVLDB},
        series = {{VLDB} '19},
        volume = {12},
        number = {11},
        pages = {1276--1288},
        doi = {10.14778/3342263.3342267},
        url = {https://doi.org/10.14778/3342263.3342267},
        year = {2019}
}

Incoming Citations (Sorted by Pagerank)

Showing 15 of 15 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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