{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:15:40Z","timestamp":1779174940031,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,6,18]],"date-time":"2014-06-18T00:00:00Z","timestamp":1403049600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,6,18]]},"DOI":"10.1145\/2588555.2610520","type":"proceedings-article","created":{"date-parts":[[2014,6,20]],"date-time":"2014-06-20T13:06:05Z","timestamp":1403269565000},"page":"445-456","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":34,"title":["Descriptive and prescriptive data cleaning"],"prefix":"10.1145","author":[{"given":"Anup","family":"Chalamalla","sequence":"first","affiliation":[{"name":"University of Waterloo, Waterloo, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ihab F.","family":"Ilyas","sequence":"additional","affiliation":[{"name":"University of Waterloo, Waterloo, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mourad","family":"Ouzzani","sequence":"additional","affiliation":[{"name":"Qatar Computing Research Institute, Doha, Qatar"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Papotti","sequence":"additional","affiliation":[{"name":"Qatar Computing Research Institute, Doha, Qatar"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,6,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920870"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1561\/1900000006"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544847"},{"key":"e_1_3_2_1_4_1","volume-title":"A greedy heuristic for the set-covering problem. Mathematics of operations research, 4(3):233--235","author":"Chvatal V.","year":"1979","unstructured":"V. Chvatal . A greedy heuristic for the set-covering problem. Mathematics of operations research, 4(3):233--235 , 1979 . V. Chvatal. A greedy heuristic for the set-covering problem. Mathematics of operations research, 4(3):233--235, 1979."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.27"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/846219.847324"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465327"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/2371176"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453901"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536360.2536363"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920869"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581035"},{"key":"e_1_3_2_1_13_1","volume-title":"John Wiley Publishers","author":"Inmon W. H.","year":"2005","unstructured":"W. H. Inmon . Building the Data Warehouse . John Wiley Publishers , 2005 . W. H. Inmon. Building the Data Warehouse. John Wiley Publishers, 2005."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989411"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1514894.1514901"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989376"},{"key":"e_1_3_2_1_17_1","volume-title":"Discrete location theory","author":"Mirchandani P. B.","year":"1990","unstructured":"P. B. Mirchandani and R. L. Francis . Discrete location theory . 1990 . P. B. Mirchandani and R. L. Francis. Discrete location theory. 1990."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/779232.779247"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807172"},{"key":"e_1_3_2_1_20_1","unstructured":"Transaction Processing Performance Council. The TPC Benchmark H 2.16.0. http:\/\/www.tpc.org\/tpch 2013.  Transaction Processing Performance Council. The TPC Benchmark H 2.16.0. http:\/\/www.tpc.org\/tpch 2013."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536354.2536356"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/2367502.2367531"}],"event":{"name":"SIGMOD\/PODS'14: International Conference on Management of Data","location":"Snowbird Utah USA","acronym":"SIGMOD\/PODS'14","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2588555.2610520","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2588555.2610520","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:00:49Z","timestamp":1750230049000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2588555.2610520"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,18]]},"references-count":22,"alternative-id":["10.1145\/2588555.2610520","10.1145\/2588555"],"URL":"https:\/\/doi.org\/10.1145\/2588555.2610520","relation":{},"subject":[],"published":{"date-parts":[[2014,6,18]]},"assertion":[{"value":"2014-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}