{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:17:57Z","timestamp":1742383077556,"version":"3.37.0"},"reference-count":22,"publisher":"Elsevier","isbn-type":[{"type":"print","value":"9780120884698"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1016\/b978-012088469-8.50057-7","type":"book-chapter","created":{"date-parts":[[2009,11,6]],"date-time":"2009-11-06T09:12:29Z","timestamp":1257498749000},"page":"636-647","source":"Crossref","is-referenced-by-count":20,"title":["Merging the Results of Approximate Match Operations"],"prefix":"10.1016","author":[{"given":"Sudipto","family":"Guha","sequence":"first","affiliation":[]},{"given":"Nick","family":"Koudas","sequence":"additional","affiliation":[]},{"given":"Amit","family":"Marathe","sequence":"additional","affiliation":[]},{"given":"Divesh","family":"Srivastava","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"author":"MindBox Inc.","key":"10.1016\/B978-012088469-8.50057-7_bib1"},{"year":"1992","series-title":"Network flows","author":"Ahuja","key":"10.1016\/B978-012088469-8.50057-7_bib2"},{"key":"10.1016\/B978-012088469-8.50057-7_bib3","series-title":"Proceedings of SIGMOD","article-title":"Automatic segmentation of text into structured records","author":"Borkar","year":"2001"},{"key":"10.1016\/B978-012088469-8.50057-7_bib4","series-title":"Proceedings of SIGMOD","article-title":"Integration of heterogeneous databases without common domains using queries based on textual similarity","author":"Cohen","year":"1998"},{"key":"10.1016\/B978-012088469-8.50057-7_bib5","series-title":"Proceedings of IIWeb Workshop","article-title":"A comparison of string distance metrics for name-matching tasks","author":"Cohen","year":"2003"},{"key":"10.1016\/B978-012088469-8.50057-7_bib6","series-title":"Proceedings of KDD Data Cleaning Workshop","article-title":"A comparison of string metrics for matching names and records","author":"Cohen","year":"2003"},{"key":"10.1016\/B978-012088469-8.50057-7_bib7","series-title":"Proceedings of SIGMOD","article-title":"Robust and efficient fuzzy match for online data cleaning","author":"Chaudhuri","year":"2003"},{"year":"1985","series-title":"Metric methods for analyzing partially ranked data","author":"Critchlow","key":"10.1016\/B978-012088469-8.50057-7_bib8"},{"year":"2003","series-title":"Exploratory data mining and data cleaning","author":"Dasu","key":"10.1016\/B978-012088469-8.50057-7_bib9"},{"issue":"2","key":"10.1016\/B978-012088469-8.50057-7_bib10","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1111\/j.2517-6161.1977.tb01624.x","article-title":"Spearman's footrule as a measure of disarray","volume":"39","author":"Diaconis","year":"1997","journal-title":"J. of the Royal Statistical Society"},{"key":"10.1016\/B978-012088469-8.50057-7_bib11","series-title":"Proceedings of WWW10","article-title":"Rank aggregation methods for the web","author":"Dwork","year":"2001"},{"key":"10.1016\/B978-012088469-8.50057-7_bib12","series-title":"Proceedings of PODS","article-title":"Optimal aggregation algorithms for middleware","author":"Fagin","year":"2001"},{"key":"10.1016\/B978-012088469-8.50057-7_bib13","series-title":"Proceedings of SODA","article-title":"Comparing top-k lists","author":"Fagin","year":"2003"},{"key":"10.1016\/B978-012088469-8.50057-7_bib14","series-title":"Proceedings of SIGMOD","article-title":"Efficient similarity search and classification via rank aggregation","author":"Fagin","year":"2003"},{"issue":"328","key":"10.1016\/B978-012088469-8.50057-7_bib15","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1080\/01621459.1969.10501049","article-title":"A theory for record linkage","volume":"64","author":"Fellegi","year":"1969","journal-title":"Journal of the American Statistical Association"},{"key":"10.1016\/B978-012088469-8.50057-7_bib16","series-title":"Proceedings of VLDB","article-title":"Declarative data cleaning","author":"Galhardas","year":"2001"},{"key":"10.1016\/B978-012088469-8.50057-7_bib17","series-title":"Proceedings of VLDB","article-title":"Approximate string joins in a database (almost) for free","author":"Gravano","year":"2001"},{"key":"10.1016\/B978-012088469-8.50057-7_bib18","series-title":"Proceedings of WWW","article-title":"Text joints in an RDBMS for web data integration","author":"Gravano","year":"2003"},{"key":"10.1016\/B978-012088469-8.50057-7_bib19","series-title":"Proceedings of SIGMOD","article-title":"the merge purge problem for large databases","author":"Hernandez","year":"1995"},{"year":"1995","series-title":"Analyzing and modeling rank data","author":"Marden","key":"10.1016\/B978-012088469-8.50057-7_bib20"},{"issue":"4","key":"10.1016\/B978-012088469-8.50057-7_bib21","article-title":"Special issue on data cleaning","volume":"23","author":"Sarawagi","year":"2000","journal-title":"IEEE Data Engineering Bulletin"},{"key":"10.1016\/B978-012088469-8.50057-7_bib22","series-title":"Proceedings of KDD","article-title":"Interactive deduplication using active learning","author":"Sarawagi","year":"2002"}],"container-title":["Proceedings 2004 VLDB Conference"],"original-title":[],"language":"en","deposited":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T03:22:18Z","timestamp":1739416938000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B9780120884698500577"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9780120884698"],"references-count":22,"URL":"https:\/\/doi.org\/10.1016\/b978-012088469-8.50057-7","relation":{},"subject":[],"published":{"date-parts":[[2004]]}}}