{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:54:27Z","timestamp":1757631267127,"version":"3.44.0"},"reference-count":9,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2023,8]]},"abstract":"<jats:p>Database management systems (DBMSs) are prone to logic bugs that can result in incorrect query results. Current debugging tools are limited to single table queries and struggle with issues like lack of ground-truth results and repetitive query space exploration. In this paper, we demonstrate DLBD, a system that automatically detects logic bugs in databases. DLBD offers holistic logic bug detection by providing automatic schema and query generation and ground-truth query result retrieval. Additionally, DLBD provides minimal test cases and root cause analysis for each bug to aid developers in reproducing and fixing detected bugs. DLBD incorporates heuristics and domain-specific knowledge to efficiently prune the search space and employs query space exploration mechanisms to avoid the repetitive search. Finally, DLBD utilizes a distributed processing framework to test database logic bugs in a scalable and efficient manner. Our system offers developers a reliable and effective way to detect and fix logic bugs in DBMSs.<\/jats:p>","DOI":"10.14778\/3611540.3611584","type":"journal-article","created":{"date-parts":[[2023,9,15]],"date-time":"2023-09-15T11:32:37Z","timestamp":1694777557000},"page":"3914-3917","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["A Demonstration of DLBD: Database Logic Bug Detection System"],"prefix":"10.14778","volume":"16","author":[{"given":"Xiu","family":"Tang","sequence":"first","affiliation":[{"name":"Zhejiang University, China"}]},{"given":"Sai","family":"Wu","sequence":"additional","affiliation":[{"name":"Zhejiang University, China"}]},{"given":"Dongxiang","family":"Zhang","sequence":"additional","affiliation":[{"name":"Zhejiang University, China"}]},{"given":"Ziyue","family":"Wang","sequence":"additional","affiliation":[{"name":"Zhejiang University, China"}]},{"given":"Gongsheng","family":"Yuan","sequence":"additional","affiliation":[{"name":"Zhejiang University, China"}]},{"given":"Gang","family":"Chen","sequence":"additional","affiliation":[{"name":"Zhejiang University, China"}]}],"member":"320","published-online":{"date-parts":[[2023,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE48619.2023.00174"},{"key":"e_1_2_1_2_1","volume-title":"TANE: An efficient algorithm for discovering functional and approximate dependencies. The computer journal 42, 2","author":"Huhtala Yka","year":"1999","unstructured":"Yka Huhtala, Juha Karkkainen, Pasi Porkka, and Hannu Toivonen. 1999. TANE: An efficient algorithm for discovering functional and approximate dependencies. The computer journal 42, 2 (1999), 100--111."},{"key":"e_1_2_1_3_1","unstructured":"Thorsten Papenbrock and Felix Naumann. 2017. Data-driven Schema Normalization. In EDBT. OpenProceedings.org 342--353."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3368089.3409710"},{"key":"e_1_2_1_5_1","unstructured":"Manuel Rigger and Zhendong Su. 2020. SQLancer. [EB\/OL]. https:\/\/github.com\/sqlancer\/sqlancer."},{"key":"e_1_2_1_6_1","unstructured":"Manuel Rigger and Zhendong Su. 2020. Testing database engines via pivoted query synthesis. In OSDI 20. 667--682."},{"key":"e_1_2_1_7_1","unstructured":"Apache Spark. 2020. Apache Spark. [EB\/OL]. https:\/\/spark.apache.org."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3588909"},{"volume-title":"Compressing Bitmap Indexes for Faster Search Operations","author":"Wu Kesheng","key":"e_1_2_1_9_1","unstructured":"Kesheng Wu, Ekow J. Otoo, and Arie Shoshani. 2002. Compressing Bitmap Indexes for Faster Search Operations. In SSDBM. IEEE Computer Society, 99--108."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3611540.3611584","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:36:10Z","timestamp":1757543770000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3611540.3611584"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8]]},"references-count":9,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["10.14778\/3611540.3611584"],"URL":"https:\/\/doi.org\/10.14778\/3611540.3611584","relation":{},"ISSN":["2150-8097"],"issn-type":[{"type":"print","value":"2150-8097"}],"subject":[],"published":{"date-parts":[[2023,8]]},"assertion":[{"value":"2023-08-01","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}