{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,4]],"date-time":"2025-10-04T18:07:51Z","timestamp":1759601271931,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2018,5,17]],"date-time":"2018-05-17T00:00:00Z","timestamp":1526515200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s10618-018-0563-0","type":"journal-article","created":{"date-parts":[[2018,5,17]],"date-time":"2018-05-17T06:48:34Z","timestamp":1526539714000},"page":"1229-1250","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Fast schemes for online record linkage"],"prefix":"10.1007","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3878-5988","authenticated-orcid":false,"given":"Dimitrios","family":"Karapiperis","sequence":"first","affiliation":[]},{"given":"Aris","family":"Gkoulalas-Divanis","sequence":"additional","affiliation":[]},{"given":"Vassilios S.","family":"Verykios","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,17]]},"reference":[{"key":"563_CR1","first-page":"1846","volume":"6","author":"H Altwaijry","year":"2013","unstructured":"Altwaijry H, Kalashnikov D, Mehrotra S (2013) Query-driven approach to entity resolution. Int Conf Very Large Data Bases (PVLDB) 6:1846\u20131857","journal-title":"Int Conf Very Large Data Bases (PVLDB)"},{"issue":"1","key":"563_CR2","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1145\/1327452.1327494","volume":"51","author":"A Andoni","year":"2008","unstructured":"Andoni A, Indyk P (2008) Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun ACM (CACM) 51(1):117\u2013122","journal-title":"Commun ACM (CACM)"},{"key":"563_CR3","doi-asserted-by":"crossref","unstructured":"Bhattacharya I, Getoor L Licamele L (2006) Query-time entity resolution. In: International conference on knowledge discovery and data mining (KDD), pp 529\u2013534","DOI":"10.1145\/1150402.1150463"},{"key":"563_CR4","doi-asserted-by":"crossref","unstructured":"Bilenko M, Kamath B, Mooney RJ (2006) Adaptive blocking: learning to scale up record linkage. In: International conference on data mining (ICDM), pp 87\u201396","DOI":"10.1109\/ICDM.2006.13"},{"issue":"9","key":"563_CR5","doi-asserted-by":"publisher","first-page":"1537","DOI":"10.1109\/TKDE.2011.127","volume":"12","author":"P Christen","year":"2012","unstructured":"Christen P (2012) A survey of indexing techniques for scalable record linkage and deduplication. Trans Knowl Data Eng (TKDE) 12(9):1537\u20131555","journal-title":"Trans Knowl Data Eng (TKDE)"},{"key":"563_CR6","doi-asserted-by":"crossref","unstructured":"Christen P, Gayler R, Hawking D (2009) Similarity\u2014aware indexing for real-time entity resolution. In: International conference on information and knowledge management (CIKM), pp 1565\u20131568","DOI":"10.1145\/1645953.1646173"},{"key":"563_CR7","unstructured":"Cohen WW, Richman J (2002) Learning to match and cluster large high-dimensional data sets for data integration. In: International conference on knowledge discovery and data mining (SIGKDD), pp 475\u2013480"},{"issue":"3","key":"563_CR8","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1109\/TKDE.2010.134","volume":"23","author":"D Dey","year":"2011","unstructured":"Dey D, Mookerjee V, Liu D (2011) Efficient techniques for online record linkage. Trans Knowl Data Eng (TKDE) 23(3):373\u2013387","journal-title":"Trans Knowl Data Eng (TKDE)"},{"issue":"1","key":"563_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TKDE.2007.250581","volume":"19","author":"A Elmagarmid","year":"2007","unstructured":"Elmagarmid A, Ipeirotis P, Verykios V (2007) Duplicate record detection: a survey. Trans Knowl Data Eng (TKDE) 19(1):1\u201316","journal-title":"Trans Knowl Data Eng (TKDE)"},{"key":"563_CR10","first-page":"384","volume":"9","author":"D Firmani","year":"2016","unstructured":"Firmani D, Saha B, Srivastava D (2016) Online entity resolution using an oracle. Int Conf Very Large Data Bases (PVLDB) 9:384\u2013395","journal-title":"Int Conf Very Large Data Bases (PVLDB)"},{"key":"563_CR11","unstructured":"Hernandez MA, Stolfo SJ (1995) The merge\/purge problem for large databases. In: International conference on management of data (SIGMOD), pp 127\u2013138"},{"issue":"1","key":"563_CR12","first-page":"429","volume":"3","author":"E Ioannou","year":"2010","unstructured":"Ioannou E, Nejdl W, Niederee C, Velegrakis Y (2010) On-the-fly entity-aware query processing in the presence of linkage. Int Conf Very Large Data Bases (PVLDB) 3(1):429\u2013438","journal-title":"Int Conf Very Large Data Bases (PVLDB)"},{"issue":"4","key":"563_CR13","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1109\/TKDE.2014.2349916","volume":"27","author":"D Karapiperis","year":"2015","unstructured":"Karapiperis D, Verykios VS (2015) An LSH-based blocking approach with a homomorphic matching technique for privacy-preserving record linkage. Trans Knowl Data Eng (TKDE) 27(4):909\u2013921","journal-title":"Trans Knowl Data Eng (TKDE)"},{"issue":"3","key":"563_CR14","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1007\/s10115-016-0919-y","volume":"49","author":"D Karapiperis","year":"2016","unstructured":"Karapiperis D, Verykios VS (2016) A fast and efficient Hamming LSH-based scheme for accurate linkage. Knowl Inf Syst (KAIS) 49(3):861\u2013884","journal-title":"Knowl Inf Syst (KAIS)"},{"key":"563_CR15","doi-asserted-by":"crossref","unstructured":"Karapiperis D, Gkoulalas-Divanis A, Verykios VS (2016a) LSHDB: a parallel and distributed engine for record linkage and similarity search. In: International conference on data mining (ICDM) demos, pp 1\u20134","DOI":"10.1109\/ICDMW.2016.7867099"},{"key":"563_CR16","unstructured":"Karapiperis D, Vatsalan D, Verykios VS, Christen P (2016b) Efficient record linakge using a compact Hamming space. In: International conference on extending database technology (EDBT), pp 209\u2013220"},{"key":"563_CR17","doi-asserted-by":"crossref","unstructured":"Kim H, Lee D (2010) Fast iterative hashed record linkage for large-scale data collections. In: International conference on extending database technology (EDBT), pp 525 \u2013 536","DOI":"10.1145\/1739041.1739104"},{"issue":"5","key":"563_CR18","doi-asserted-by":"publisher","first-page":"1316","DOI":"10.1109\/TKDE.2014.2359666","volume":"27","author":"T Papenbrock","year":"2015","unstructured":"Papenbrock T, Heise A, Naumann F (2015) Progressive duplicate detection. Trans Knowl Data Eng (TKDE) 27(5):1316\u20131329","journal-title":"Trans Knowl Data Eng (TKDE)"},{"key":"563_CR19","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1186\/1472-6947-9-41","volume":"9","author":"R Schnell","year":"2009","unstructured":"Schnell R, Bachteler T, Reiher J (2009) Privacy-preserving record linkage using Bloom filters. Med Inform Decis Mak (BMC) 9:41","journal-title":"Med Inform Decis Mak (BMC)"},{"key":"563_CR20","unstructured":"Shrivastava A, Li P (2014) Improved densification of one permutation hashing. In: International conference on uncertainty in artificial intelligence (UAI), pp 732\u2013741"},{"key":"563_CR21","doi-asserted-by":"crossref","unstructured":"Steorts R, Ventura S, Sadinle M, Fienberg S (2014) A comparison of blocking methods for record linkage. In: Privacy in statistical databases (PSD), pp 253\u2013268","DOI":"10.1007\/978-3-319-11257-2_20"},{"key":"563_CR22","doi-asserted-by":"crossref","unstructured":"Whang SE, Menestrina D, Koutrika G, Theobald M, Garcia-Molina H (2009) Entity resolution with iterative blocking. In: SIGMOD, pp 219\u2013232","DOI":"10.1145\/1559845.1559870"},{"issue":"5","key":"563_CR23","doi-asserted-by":"publisher","first-page":"1111","DOI":"10.1109\/TKDE.2012.43","volume":"25","author":"SE Whang","year":"2013","unstructured":"Whang SE, Marmaros D, Garcia-Molina H (2013) Pay-as-you-go entity resolution. Trans Knowl Data Eng (TKDE) 25(5):1111\u20131124","journal-title":"Trans Knowl Data Eng (TKDE)"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-018-0563-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-018-0563-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-018-0563-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T19:26:01Z","timestamp":1558034761000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-018-0563-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,17]]},"references-count":23,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["563"],"URL":"https:\/\/doi.org\/10.1007\/s10618-018-0563-0","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"type":"print","value":"1384-5810"},{"type":"electronic","value":"1573-756X"}],"subject":[],"published":{"date-parts":[[2018,5,17]]},"assertion":[{"value":"5 February 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 March 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 May 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}