DBScholar

Back to papers

Proving Query Equivalence Using Linear Integer Arithmetic

Summary: Introduces SQLSolver, an SQL-equivalence prover that handles unbounded summations with the LIA* theory for principled algebraic modeling and SMT-based decision. Extends LIA* to nested summations; evaluates on 359 Calcite/Spark-derived query pairs and proves 346, outperforming existing provers. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
6836
Venue
SIGMOD
Year
2023
Pagerank
7.1403543e-05
Overall Rank
3,769 | 74.15%
DOI
10.1145/3626768

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{ding_sigmod23,
        title = {{Proving Query Equivalence Using Linear Integer Arithmetic}},
        author = {Ding, Haoran and Wang, Zhaoguo and Yang, Yicun and Zhang, Dexin and Xu, Zhenglin and Chen, Haibo and Piskac, Ruzica and Li, Jinyang},
        series = {{SIGMOD} '23},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3626768},
        url = {https://dl.acm.org/doi/10.1145/3626768},
        year = {2023}
}

Incoming Citations (Sorted by Pagerank)

Showing 12 of 12 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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