{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,10]],"date-time":"2026-05-10T10:20:14Z","timestamp":1778408414522,"version":"3.51.4"},"reference-count":58,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2014,5,1]],"date-time":"2014-05-01T00:00:00Z","timestamp":1398902400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"SRF"},{"name":"Shenzhen Peacock Program of China","award":["1.11E+15"],"award-info":[{"award-number":["1.11E+15"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61133002"],"award-info":[{"award-number":["61133002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61322207"],"award-info":[{"award-number":["61322207"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/J015377\/1"],"award-info":[{"award-number":["EP\/J015377\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ROCS"},{"DOI":"10.13039\/501100002855","name":"Ministry of Science and Technology of the People's Republic of China","doi-asserted-by":"publisher","award":["2014CB340304"],"award-info":[{"award-number":["2014CB340304"]}],"id":[{"id":"10.13039\/501100002855","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002855","name":"Ministry of Science and Technology of the People's Republic of China","doi-asserted-by":"publisher","award":["2012CB316200, 2014CB340302"],"award-info":[{"award-number":["2012CB316200, 2014CB340302"]}],"id":[{"id":"10.13039\/501100002855","id-type":"DOI","asserted-by":"publisher"}]},{"name":"SEM"},{"DOI":"10.13039\/100012540","name":"Guangdong Innovative Research Team Program","doi-asserted-by":"crossref","award":["2011D005"],"award-info":[{"award-number":["2011D005"]}],"id":[{"id":"10.13039\/100012540","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. Data and Information Quality"],"published-print":{"date-parts":[[2014,5]]},"abstract":"<jats:p>\n            Central to a data cleaning system are record matching and data repairing. Matching aims to identify tuples that refer to the same real-world object, and repairing is to make a database consistent by fixing errors in the data by using integrity constraints. These are typically treated as separate processes in current data cleaning systems, based on heuristic solutions. This article studies a new problem in connection with data cleaning, namely the interaction between record matching and data repairing. We show that repairing can effectively help us identify matches, and vice versa. To capture the interaction, we provide a uniform framework that seamlessly unifies repairing and matching operations to clean a database based on integrity constraints, matching rules, and master data. We give a full treatment of fundamental problems associated with data cleaning via matching and repairing, including the static analyses of constraints and rules taken together, and the complexity, termination, and determinism analyses of data cleaning. We show that these problems are hard, ranging from NP-complete or coNP-complete, to PSPACE-complete. Nevertheless, we propose efficient algorithms to clean data via both matching and repairing. The algorithms find\n            <jats:italic>deterministic<\/jats:italic>\n            <jats:italic>fixes<\/jats:italic>\n            and\n            <jats:italic>reliable<\/jats:italic>\n            <jats:italic>fixes<\/jats:italic>\n            based on confidence and entropy analyses, respectively, which are more accurate than fixes generated by heuristics. Heuristic fixes are produced only when deterministic or reliable fixes are unavailable. We experimentally verify that our techniques can significantly improve the accuracy of record matching and data repairing that are taken as separate processes, using real-life and synthetic data.\n          <\/jats:p>","DOI":"10.1145\/2567657","type":"journal-article","created":{"date-parts":[[2014,5,30]],"date-time":"2014-05-30T18:18:28Z","timestamp":1401473908000},"page":"1-38","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":34,"title":["Interaction between Record Matching and Data Repairing"],"prefix":"10.1145","volume":"4","author":[{"given":"Wenfei","family":"Fan","sequence":"first","affiliation":[{"name":"University of Edinburgh and SKLSDE Lab, Beihang University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuai","family":"Ma","sequence":"additional","affiliation":[{"name":"SKLSDE Lab, Beihang University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nan","family":"Tang","sequence":"additional","affiliation":[{"name":"QCRI"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenyuan","family":"Yu","sequence":"additional","affiliation":[{"name":"University of Edinburgh"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,5]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Abiteboul S. Hull R. and Vianu V. 1995. Foundations of Databases. Addison-Wesley.   Abiteboul S. Hull R. and Vianu V. 1995. Foundations of Databases . Addison-Wesley."},{"key":"e_1_2_1_2_1","volume-title":"Proceedings of the 7th Workshop on Computer Science Logic (CSL\u201993)","author":"Aiken A."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.43"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068403001832"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242591"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1938551.1938585"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687695"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066175"},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the Semantic Web Applications and Tools for Life Sciences Workshop (SWAT4LS\u201910)","author":"Bolleman J."},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of the 33rd International Conference on Very Large Data Bases (VLDB\u201907)","author":"Bravo L."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/2283696.2283767"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872796"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453980"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.127"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007374"},{"key":"e_1_2_1_16_1","volume-title":"Proceedings of the 33rd International Conference on Very Large Data Bases (VLDB\u201907)","author":"Cong G."},{"key":"e_1_2_1_17_1","unstructured":"Cormen T. H. Leiserson C. E. Rivest R. L. and Stein C. 2001. Introduction to Algorithms. The MIT Press.   Cormen T. H. Leiserson C. E. Rivest R. L. and Stein C. 2001. Introduction to Algorithms . The MIT Press."},{"key":"e_1_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Cover T. M. and Thomas J. A. 1991. Elements of Information Theory. Wiley-Interscience.   Cover T. M. and Thomas J. A. 1991. Elements of Information Theory . Wiley-Interscience.","DOI":"10.1002\/0471200611"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1921008"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066168"},{"key":"e_1_2_1_21_1","volume-title":"Data quality and the bottom line: Achieving business success through a commitment to high quality data. Tech. rep","author":"Eckerson W. W."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.9"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376916.1376940"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1366102.1366103"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920867"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-010-0206-6"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.154"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989373"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.2307\/249743"},{"key":"e_1_2_1_30_1","unstructured":"Garey M. and Johnson D. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company.   Garey M. and Johnson D. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness . W. H. Freeman and Company."},{"key":"e_1_2_1_31_1","volume-title":"Forecast: Data quality tools, worldwide. Tech. rep. 2006-2011, Gartner. https:\/\/www.gartner.com\/doc\/507207\/forecast-data-quality-tools-worldwide.","author":"Gartner","year":"2007"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920897"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1950.tb00463.x"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009761603038"},{"key":"e_1_2_1_35_1","unstructured":"Herzog T. N. Scheuren F. J. and Winkler W. E. 2009. Data Quality and Record Linkage Techniques. Springer.   Herzog T. N. Scheuren F. J. and Winkler W. E. 2009. Data Quality and Record Linkage Techniques . Springer."},{"key":"e_1_2_1_36_1","volume-title":"Information technology: Database languages, sql part 2: Foundation","author":"International Standard","edition":"2"},{"key":"e_1_2_1_37_1","unstructured":"Klir G. J. and Folger T. A. 1988. Fuzzy Sets Uncertainty and Information. Prentice Hall Englewood Cliffs NJ.   Klir G. J. and Folger T. A. 1988. Fuzzy Sets Uncertainty and Information . Prentice Hall Englewood Cliffs NJ."},{"key":"e_1_2_1_38_1","doi-asserted-by":"crossref","unstructured":"Loshin D. 2009. Master Data Management. Knowledge Integrity.   Loshin D. 2009. Master Data Management . Knowledge Integrity.","DOI":"10.1016\/B978-0-12-374225-4.00001-1"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807178"},{"key":"e_1_2_1_40_1","first-page":"21","article-title":"Data fusion in three steps: Resolving schema, tuple, and value inconsistencies","volume":"29","author":"Naumann F.","year":"2006","journal-title":"IEEE Data Engin. Bull."},{"key":"e_1_2_1_41_1","unstructured":"Otto B. and Weber K. 2009. From health checks to the seven sisters: The data quality journey at BT. BT TR-BE HSG\/CC CDQ\/8. http:\/\/www.alexandria.unisg.ch\/Publikationen\/67797.  Otto B. and Weber K. 2009. From health checks to the seven sisters: The data quality journey at BT. BT TR-BE HSG\/CC CDQ\/8. http:\/\/www.alexandria.unisg.ch\/Publikationen\/67797."},{"key":"e_1_2_1_42_1","first-page":"3","article-title":"Data cleaning: Problems and current approaches","volume":"23","author":"Rahm E.","year":"2000","journal-title":"IEEE Data Engin. Bull."},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/269012.269025"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(70)80006-X"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646135"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807337"},{"key":"e_1_2_1_47_1","unstructured":"Transaction Processing Performance Council. 2001--2013. TPC-H benchmark. http:\/\/www.tpc.org.  Transaction Processing Performance Council. 2001--2013. TPC-H benchmark. http:\/\/www.tpc.org."},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2010.08.002"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920992"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767865"},{"key":"e_1_2_1_51_1","volume-title":"Complexity Theory: Exploring the Limits of Efficient Algorithms","author":"Wegener I.","year":"2005"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066207"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-009-0136-3"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/1093382.1093385"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453957"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/2000824.2000825"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807325"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055934"}],"container-title":["Journal of Data and Information Quality"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2567657","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2567657","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:34:39Z","timestamp":1750232079000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2567657"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5]]},"references-count":58,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,5]]}},"alternative-id":["10.1145\/2567657"],"URL":"https:\/\/doi.org\/10.1145\/2567657","relation":{},"ISSN":["1936-1955","1936-1963"],"issn-type":[{"value":"1936-1955","type":"print"},{"value":"1936-1963","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5]]},"assertion":[{"value":"2013-04-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-05-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}