{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T14:10:27Z","timestamp":1744899027085,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,2,6]],"date-time":"2019-02-06T00:00:00Z","timestamp":1549411200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002347","name":"Bundesministerium f\u00fcr Bildung und Forschung","doi-asserted-by":"publisher","award":["01IS14014B"],"award-info":[{"award-number":["01IS14014B"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Datenbank Spektrum"],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s13222-019-00305-y","type":"journal-article","created":{"date-parts":[[2019,2,6]],"date-time":"2019-02-06T17:22:38Z","timestamp":1549473758000},"page":"31-40","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["ScaDS Research on Scalable Privacy-preserving Record Linkage"],"prefix":"10.1007","volume":"19","author":[{"given":"Martin","family":"Franke","sequence":"first","affiliation":[]},{"given":"Marcel","family":"Gladbach","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7700-8022","authenticated-orcid":false,"given":"Ziad","family":"Sehili","sequence":"additional","affiliation":[]},{"given":"Florens","family":"Rohde","sequence":"additional","affiliation":[]},{"given":"Erhard","family":"Rahm","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,6]]},"reference":[{"key":"305_CR1","series-title":"GRLC, Working Paper WP-GRLC-2013-02","volume-title":"Similarity filtering with multibit trees for record linkage","author":"T Bachteler","year":"2013","unstructured":"Bachteler T, Reiher J, Schnell R (2013) Similarity filtering with multibit trees for record linkage. GRLC, Working Paper WP-GRLC-2013-02"},{"issue":"7","key":"305_CR2","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B Bloom","year":"1970","unstructured":"Bloom B (1970) Space\/time trade-offs in hash coding with allowable errors. CACM 13(7):422\u2013426. \n                    https:\/\/doi.org\/10.1145\/362686.362692","journal-title":"CACM"},{"issue":"1","key":"305_CR3","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1186\/s12911-017-0478-5","volume":"17","author":"AP Brown","year":"2017","unstructured":"Brown AP, Borgs C, Randall SM, Schnell R (2017) Evaluating privacy-preserving record linkage using cryptographic long-term keys and multibit trees on large medical datasets. BMC Med Inform Decis Mak 17(1):83. \n                    https:\/\/doi.org\/10.1186\/s12911-017-0478-5","journal-title":"BMC Med. Inform. Decis. Mak."},{"issue":"4","key":"305_CR4","first-page":"28","volume":"36","author":"P Carbone","year":"2015","unstructured":"Carbone P et al (2015) Apache Flink: Stream and batch processing in a\u00a0single engine. IEEE TCDE 36(4):28\u201338","journal-title":"IEEE TCDE"},{"key":"305_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31164-2","volume-title":"Data matching: concepts and techniques for record linkage, entity resolution, and duplicate detection","author":"P Christen","year":"2012","unstructured":"Christen P (2012) Data matching: concepts and techniques for record linkage, entity resolution, and duplicate detection. Springer, Berlin, Heidelberg \n                    https:\/\/doi.org\/10.1007\/978-3-642-31164-2"},{"issue":"9","key":"305_CR6","doi-asserted-by":"publisher","first-page":"1537","DOI":"10.1109\/TKDE.2011.127","volume":"24","author":"P Christen","year":"2012","unstructured":"Christen P (2012) A\u00a0survey of indexing techniques for scalable record linkage and deduplication. IEEE Trans Knowl Data Eng 24(9):1537\u20131555. \n                    https:\/\/doi.org\/10.1109\/TKDE.2011.127","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"305_CR7","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1145\/2505515.2507815","volume-title":"ACM CIKM","author":"P Christen","year":"2013","unstructured":"Christen P, Vatsalan D (2013) Flexible and extensible generation and corruption of personal data. In: ACM CIKM, pp 1165\u20131168 \n                    https:\/\/doi.org\/10.1145\/2505515.2507815"},{"issue":"3","key":"305_CR8","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1136\/ip.2003.004580","volume":"10","author":"DE Clark","year":"2004","unstructured":"Clark DE (2004) Practical introduction to record linkage for injury research. Inj Prev 10(3):186\u2013191. \n                    https:\/\/doi.org\/10.1136\/ip.2003.004580","journal-title":"Inj Prev"},{"key":"305_CR9","volume-title":"A\u00a0framework for accurate, efficient private record linkage","author":"EA Durham","year":"2012","unstructured":"Durham EA (2012) A\u00a0framework for accurate, efficient private record linkage. Faculty of the Graduate School of Vanderbilt University, Nashville, TN, (Ph.D. thesis)"},{"issue":"1","key":"305_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TKDE.2007.250581","volume":"19","author":"AK Elmagarmid","year":"2007","unstructured":"Elmagarmid AK, Ipeirotis PG, Verykios VS (2007) Duplicate record detection: a\u00a0survey. IEEE Trans Knowl Data Eng 19(1):1\u201316. \n                    https:\/\/doi.org\/10.1109\/TKDE.2007.250581","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"305_CR11","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-030-00305-0_19","volume-title":"Data privacy management, Cryptocurrencies and Blockchain technology","author":"M Franke","year":"2018","unstructured":"Franke M, Sehili Z, Gladbach M, Rahm E (2018) Post-processing methods for high quality privacy-preserving record linkage. In: Data privacy management, Cryptocurrencies and Blockchain technology. Springer, Berlin, Heidelberg, pp 263\u2013278 \n                    https:\/\/doi.org\/10.1007\/978-3-030-00305-0_19"},{"key":"305_CR12","doi-asserted-by":"publisher","first-page":"195","DOI":"10.5220\/0006682701950203","volume-title":"IoTBDS","author":"M Franke","year":"2018","unstructured":"Franke M, Sehili Z, Rahm E (2018) Parallel privacy preserving record linkage using LSH-based blocking. In: IoTBDS, pp 195\u2013203 \n                    https:\/\/doi.org\/10.5220\/0006682701950203"},{"key":"305_CR13","first-page":"518","volume-title":"Proceedings of the 25th VLDB Conference","author":"A Gionis","year":"1999","unstructured":"Gionis A, Indyk P, Motwani R et al (1999) Similarity search in high dimensions via hashing. In: Proceedings of the 25th VLDB Conference, vol 99, pp 518\u2013529"},{"key":"305_CR14","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1109\/ICDEW.2018.00013","volume-title":"ICDE-W","author":"M Gladbach","year":"2018","unstructured":"Gladbach M, Sehili Z, Kudra\u00df T, Christen P, Rahm E (2018) Distributed privacy-preserving record linkage using pivot-based filter techniques. In: ICDE-W, pp 33\u201338 \n                    https:\/\/doi.org\/10.1109\/ICDEW.2018.00013"},{"issue":"1","key":"305_CR15","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1023\/A:1009761603038","volume":"2","author":"MA Hern\u00e1ndez","year":"1998","unstructured":"Hern\u00e1ndez MA, Stolfo SJ (1998) Real-world data is dirty: data cleansing and the merge\/purge problem. Data Min Knowl Discov 2(1):9\u201337. \n                    https:\/\/doi.org\/10.1023\/A:1009761603038","journal-title":"Data Min Knowl Discov"},{"key":"305_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-69505-2","volume-title":"Data quality and record linkage techniques","author":"TN Herzog","year":"2007","unstructured":"Herzog TN, Scheuren FJ, Winkler WE (2007) Data quality and record linkage techniques, 1st\u00a0edn. Springer, Berlin, Heidelberg \n                    https:\/\/doi.org\/10.1007\/0-387-69505-2","edition":"1"},{"issue":"8","key":"305_CR17","doi-asserted-by":"publisher","first-page":"625","DOI":"10.14778\/2732296.2732299","volume":"7","author":"Y Jiang","year":"2014","unstructured":"Jiang Y, Li G, Feng J, Li WS (2014) String similarity joins: an experimental evaluation. Proc VLDB Endow 7(8):625\u2013636. \n                    https:\/\/doi.org\/10.14778\/2732296.2732299","journal-title":"Proc. VLDB Endow"},{"issue":"2","key":"305_CR18","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.datak.2009.10.003","volume":"69","author":"H K\u00f6pcke","year":"2010","unstructured":"K\u00f6pcke H, Rahm E (2010) Frameworks for entity matching: a\u00a0comparison. DKE 69(2):197\u2013210. \n                    https:\/\/doi.org\/10.1016\/j.datak.2009.10.003","journal-title":"DKE"},{"issue":"6","key":"305_CR19","doi-asserted-by":"publisher","first-page":"1553","DOI":"10.1093\/ije\/dyr142","volume":"41","author":"CE Kuehni","year":"2012","unstructured":"Kuehni CE, Rueegg CS, Michel G, Rebholz CE, Strippoli MPF, Niggli FK, Egger M, von der Weid NX (2012) Cohort profile: the Swiss childhood cancer survivor study. Int J Epidemiol 41(6):1553\u20131564. \n                    https:\/\/doi.org\/10.1093\/ije\/dyr142","journal-title":"Int J Epidemiol"},{"key":"305_CR20","doi-asserted-by":"publisher","DOI":"10.1186\/s12911-014-0123-5","author":"M Lablans","year":"2015","unstructured":"Lablans M, Borg A, \u00dcckert F (2015) A\u00a0RESTful interface to pseudonymization services in modern web applications. BMC Med Inform Decis Mak. \n                    https:\/\/doi.org\/10.1186\/s12911-014-0123-5","journal-title":"BMC Med Inform Decis Mak"},{"issue":"1","key":"305_CR21","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1136\/amiajnl-2012-001509","volume":"20","author":"BA Malin","year":"2013","unstructured":"Malin BA, Emam KE, O\u2019Keefe CM (2013) Biomedical data privacy: problems, perspectives, and recent advances. J Am Med Inform Assoc 20(1):2\u20136. \n                    https:\/\/doi.org\/10.1136\/amiajnl-2012-001509","journal-title":"J. Am. Med. Inform. Assoc."},{"key":"305_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-016-0504-4","author":"R Mao","year":"2016","unstructured":"Mao R, Zhang P, Li X, Liu X, Lu M (2016) Pivot selection for metric-space indexing. Int J Mach Learn Cybern. \n                    https:\/\/doi.org\/10.1007\/s13042-016-0504-4","journal-title":"Int J Mach Learn Cybern"},{"key":"305_CR23","series-title":"US Patents 1261167","volume-title":"The soundex coding system","author":"M Odell","year":"1918","unstructured":"Odell M, Russell R (1918) The soundex coding system. US Patents 1261167"},{"issue":"4","key":"305_CR24","first-page":"3","volume":"23","author":"E Rahm","year":"2000","unstructured":"Rahm E, Do HH (2000) Data cleaning: problems and current approaches. IEEE Data Eng Bull 23(4):3\u201313","journal-title":"IEEE Data Eng Bull"},{"issue":"1","key":"305_CR25","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. BMC Med Inform Decis Mak 9(1):41. \n                    https:\/\/doi.org\/10.1186\/1472-6947-9-41","journal-title":"BMC Med. Inform. Decis. Mak."},{"key":"305_CR26","series-title":"GRLC, No. WP-GRLC-2011-02","volume-title":"A\u00a0novel error-tolerant anonymous linking code","author":"R Schnell","year":"2011","unstructured":"Schnell R, Bachteler T, Reiher J (2011) A\u00a0novel error-tolerant anonymous linking code. GRLC, No. WP-GRLC-2011-02"},{"key":"305_CR27","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1109\/ICDMW.2016.0038","volume-title":"IEEE ICDMW","author":"R Schnell","year":"2016","unstructured":"Schnell R, Borgs C (2016) Randomized response and balanced bloom filters for privacy preserving record linkage. In: IEEE ICDMW, pp 218\u2013224 \n                    https:\/\/doi.org\/10.1109\/ICDMW.2016.0038"},{"key":"305_CR28","volume-title":"Proc. BTW","author":"Z Sehili","year":"2015","unstructured":"Sehili Z, Kolb L, Borgs C, Schnell R, Rahm E (2015) Privacy preserving record linkage with PPJoin. In: Proc. BTW"},{"issue":"3","key":"305_CR29","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s13222-016-0222-9","volume":"16","author":"Z Sehili","year":"2016","unstructured":"Sehili Z, Rahm E (2016) Speeding up privacy preserving record linkage for metric space similarity measures. Datenbank Spektrum 16(3):227\u2013236. \n                    https:\/\/doi.org\/10.1007\/s13222-016-0222-9","journal-title":"Datenbank Spektrum"},{"issue":"6","key":"305_CR30","doi-asserted-by":"publisher","first-page":"946","DOI":"10.1016\/j.is.2012.11.005","volume":"38","author":"D Vatsalan","year":"2013","unstructured":"Vatsalan D, Christen P, Verykios VS (2013) A\u00a0taxonomy of privacy-preserving record linkage techniques. Inf Syst 38(6):946\u2013969. \n                    https:\/\/doi.org\/10.1016\/j.is.2012.11.005","journal-title":"Inf Syst"},{"key":"305_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49340-4_25","author":"D Vatsalan","year":"2017","unstructured":"Vatsalan D, Sehili Z, Christen P, Rahm E (2017) Privacy-preserving record linkage for big data: current approaches and research challenges. Handb Big Data Technol. \n                    https:\/\/doi.org\/10.1007\/978-3-319-49340-4_25","journal-title":"Handb Big Data Technol"},{"issue":"1","key":"305_CR32","doi-asserted-by":"publisher","first-page":"e92","DOI":"10.3414\/ME18-02-0004","volume":"57","author":"A Winter","year":"2018","unstructured":"Winter A, St\u00e4ubert S, Ammon D, Aiche S, Beyan O, Bischoff V, Daumke P, Decker S, Funkat G, Gewehr JE, de Greiff A, Haferkamp S, Hahn U, Henkel A, Kirsten T, Kl\u00f6ss T, Lippert J, L\u00f6be M, Lowitsch V, Maassen O, Maschmann J, Meister S, Mikolajczyk R, N\u00fcchter M, Pletz MW, Rahm E, Riedel M, Saleh K, Schuppert A, Smers S, Stollenwerk A, Uhlig S, Wendt T, Zenker S, Fleig W, Marx G, Scherag A, L\u00f6ffler M (2018) Smart Medical Information Technology for Healthcare (SMITH). Methods Inf Med 57(1):e92\u2013e105. \n                    https:\/\/doi.org\/10.3414\/ME18-02-0004","journal-title":"Methods Inf Med"},{"key":"305_CR33","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1145\/1367497.1367516","volume-title":"Proceedings of the 17th International Conference on World Wide Web","author":"C Xiao","year":"2008","unstructured":"Xiao C, Wang W, Lin X, Yu JX (2008) Efficient similarity joins for near duplicate detection. In: Proceedings of the 17th International Conference on World Wide Web, pp 131\u2013140 \n                    https:\/\/doi.org\/10.1145\/1367497.1367516"},{"key":"305_CR34","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-29151-2","volume-title":"Similarity search: the metric space approach","author":"P Zezula","year":"2006","unstructured":"Zezula P, Amato G, Dohnal V, Batko M (2006) Similarity search: the metric space approach. Springer, Berlin, Heidelberg \n                    https:\/\/doi.org\/10.1007\/0-387-29151-2"}],"container-title":["Datenbank-Spektrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13222-019-00305-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13222-019-00305-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13222-019-00305-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,6]],"date-time":"2020-03-06T13:32:08Z","timestamp":1583501528000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13222-019-00305-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,6]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["305"],"URL":"https:\/\/doi.org\/10.1007\/s13222-019-00305-y","relation":{},"ISSN":["1618-2162","1610-1995"],"issn-type":[{"type":"print","value":"1618-2162"},{"type":"electronic","value":"1610-1995"}],"subject":[],"published":{"date-parts":[[2019,2,6]]},"assertion":[{"value":"8 October 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 January 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 February 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}