Reproducibility Report for ACM SIGMOD 2024 Paper: 'Proving Query Equivalence Using Linear Integer Arithmetic'
The reproducibility evaluation successfully replicated key functionalities of SQLSolver. During the review process, we found a discrepancy in the verification speed regarding SQLSolver, i.e., SQLSolver's reproduced verification latency is much higher than the result in the paper. Because after the paper was published, the authors of the paper further added some optimizations to SQLSolver, which aim at enhancing the verification capabilities and can help prove 4 more cases. However, these optimizations affect the speed of verification. After the authors of the paper provided the original version, we can successfully reproduce the main results.
Authors
- Yicong Huang
- Yingli Zhou (ORCID: https://orcid.org/0009-0008-5630-6822)
- Yinzhao Yan (ORCID: https://orcid.org/0000-0001-6261-1569)
- Haoran Ding (ORCID: https://orcid.org/0009-0008-8138-8639)
Institutions
- Shanghai Jiao Tong University (CN)
- Hong Kong University of Science and Technology (HK)
- University of California, Irvine (US)
- Chinese University of Hong Kong, Shenzhen (CN)
Publication Details
- Published
- 2025-03-21
- DOI
- https://doi.org/10.1145/3687998.3717037
- Primary Topic
- Logic, programming, and type systems
- Type
- article
- Field-Weighted Citation Impact
- 0.00