{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:25:31Z","timestamp":1750220731504,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":9,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,5,31]],"date-time":"2020-05-31T00:00:00Z","timestamp":1590883200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"The Natural Science Foundation of Zhejiang Province of China","award":["LY18F020005"],"award-info":[{"award-number":["LY18F020005"]}]},{"name":"National Natural Science Foundation of China","award":["61702449"],"award-info":[{"award-number":["61702449"]}]},{"name":"The Key Research and Development Program of Zhejiang Province of China","award":["2020C01024"],"award-info":[{"award-number":["2020C01024"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,11]]},"DOI":"10.1145\/3318464.3384683","type":"proceedings-article","created":{"date-parts":[[2020,5,29]],"date-time":"2020-05-29T17:12:33Z","timestamp":1590772353000},"page":"2697-2700","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["AUDITOR: A System Designed for Automatic Discovery of Complex Integrity Constraints in Relational Databases"],"prefix":"10.1145","author":[{"given":"Wentao","family":"Hu","sequence":"first","affiliation":[{"name":"Zhejiang University, HangZhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongxiang","family":"Zhang","sequence":"additional","affiliation":[{"name":"Zhejiang University, HangZhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dawei","family":"Jiang","sequence":"additional","affiliation":[{"name":"Zhejiang University, HangZhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sai","family":"Wu","sequence":"additional","affiliation":[{"name":"Zhejiang University, HangZhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ke","family":"Chen","sequence":"additional","affiliation":[{"name":"Zhejiang University, HangZhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kian-Lee","family":"Tan","sequence":"additional","affiliation":[{"name":"School of Computing National University of Singapore, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gang","family":"Chen","sequence":"additional","affiliation":[{"name":"Zhejiang University, HangZhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,5,31]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"668","article-title":"BHUNT: Automatic discovery of fuzzy algebraic constraints in relational data","volume":"1","author":"Brown Paul G","year":"2003","unstructured":"Paul G Brown and Peter J Hass . 2003 . BHUNT: Automatic discovery of fuzzy algebraic constraints in relational data . Proc. VLDB Endow. 1 , 1(2003), 668 -- 679 . Paul G Brown and Peter J Hass. 2003. BHUNT: Automatic discovery of fuzzy algebraic constraints in relational data. Proc. VLDB Endow. 1, 1(2003), 668--679.","journal-title":"Proc. VLDB Endow."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2472010"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.14778\/3352063.3352101"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.154"},{"key":"e_1_3_2_1_5_1","volume-title":"TANE: An efficient algorithm for discovering functional and approximate dependencies. The computer journal42, 2","author":"Huhtala Yka","year":"1999","unstructured":"Yka Huhtala , Juha K\u00e4rkk\u00e4inen , Pasi Porkka , and Hannu Toivonen . 1999 . TANE: An efficient algorithm for discovering functional and approximate dependencies. The computer journal42, 2 (1999), 100--111. Yka Huhtala, Juha K\u00e4rkk\u00e4inen, Pasi Porkka, and Hannu Toivonen. 1999. TANE: An efficient algorithm for discovering functional and approximate dependencies. The computer journal42, 2 (1999), 100--111."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/3192965.3192968"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s41019-019-00106-z"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732240.2732250"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/3368289.3368293"}],"event":{"name":"SIGMOD\/PODS '20: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Portland OR USA","acronym":"SIGMOD\/PODS '20"},"container-title":["Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3318464.3384683","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3318464.3384683","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:38:23Z","timestamp":1750199903000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3318464.3384683"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,31]]},"references-count":9,"alternative-id":["10.1145\/3318464.3384683","10.1145\/3318464"],"URL":"https:\/\/doi.org\/10.1145\/3318464.3384683","relation":{},"subject":[],"published":{"date-parts":[[2020,5,31]]},"assertion":[{"value":"2020-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}