%0 Journal Article %1 Rohde2021-ow %A Rohde, Florens %A Franke, Martin %A Sehili, Ziad %A Lablans, Martin %A Rahm, Erhard %D 2021 %I Springer Science and Business Media LLC %J J. Transl. Med. %K Blocking; Locality-sensitive Mainzelliste; Privacy-preserving hashing; linkage record %N 1 %P 33 %T Optimization of the Mainzelliste software for fast privacy-preserving record linkage %V 19 %X BACKGROUND: Data analysis for biomedical research often requires a record linkage step to identify records from multiple data sources referring to the same person. Due to the lack of unique personal identifiers across these sources, record linkage relies on the similarity of personal data such as first and last names or birth dates. However, the exchange of such identifying data with a third party, as is the case in record linkage, is generally subject to strict privacy requirements. This problem is addressed by privacy-preserving record linkage (PPRL) and pseudonymization services. Mainzelliste is an open-source record linkage and pseudonymization service used to carry out PPRL processes in real-world use cases. METHODS: We evaluate the linkage quality and performance of the linkage process using several real and near-real datasets with different properties w.r.t. size and error-rate of matching records. We conduct a comparison between (plaintext) record linkage and PPRL based on encoded records (Bloom filters). Furthermore, since the Mainzelliste software offers no blocking mechanism, we extend it by phonetic blocking as well as novel blocking schemes based on locality-sensitive hashing (LSH) to improve runtime for both standard and privacy-preserving record linkage. RESULTS: The Mainzelliste achieves high linkage quality for PPRL using field-level Bloom filters due to the use of an error-tolerant matching algorithm that can handle variances in names, in particular missing or transposed name compounds. However, due to the absence of blocking, the runtimes are unacceptable for real use cases with larger datasets. The newly implemented blocking approaches improve runtimes by orders of magnitude while retaining high linkage quality. CONCLUSION: We conduct the first comprehensive evaluation of the record linkage facilities of the Mainzelliste software and extend it with blocking methods to improve its runtime. We observed a very high linkage quality for both plaintext as well as encoded data even in the presence of errors. The provided blocking methods provide order of magnitude improvements regarding runtime performance thus facilitating the use in research projects with large datasets and many participants.

@article{Rohde2021-ow, abstract = {BACKGROUND: Data analysis for biomedical research often requires a record linkage step to identify records from multiple data sources referring to the same person. Due to the lack of unique personal identifiers across these sources, record linkage relies on the similarity of personal data such as first and last names or birth dates. However, the exchange of such identifying data with a third party, as is the case in record linkage, is generally subject to strict privacy requirements. This problem is addressed by privacy-preserving record linkage (PPRL) and pseudonymization services. Mainzelliste is an open-source record linkage and pseudonymization service used to carry out PPRL processes in real-world use cases. METHODS: We evaluate the linkage quality and performance of the linkage process using several real and near-real datasets with different properties w.r.t. size and error-rate of matching records. We conduct a comparison between (plaintext) record linkage and PPRL based on encoded records (Bloom filters). Furthermore, since the Mainzelliste software offers no blocking mechanism, we extend it by phonetic blocking as well as novel blocking schemes based on locality-sensitive hashing (LSH) to improve runtime for both standard and privacy-preserving record linkage. RESULTS: The Mainzelliste achieves high linkage quality for PPRL using field-level Bloom filters due to the use of an error-tolerant matching algorithm that can handle variances in names, in particular missing or transposed name compounds. However, due to the absence of blocking, the runtimes are unacceptable for real use cases with larger datasets. The newly implemented blocking approaches improve runtimes by orders of magnitude while retaining high linkage quality. CONCLUSION: We conduct the first comprehensive evaluation of the record linkage facilities of the Mainzelliste software and extend it with blocking methods to improve its runtime. We observed a very high linkage quality for both plaintext as well as encoded data even in the presence of errors. The provided blocking methods provide order of magnitude improvements regarding runtime performance thus facilitating the use in research projects with large datasets and many participants.}, added-at = {2024-09-10T11:54:51.000+0200}, author = {Rohde, Florens and Franke, Martin and Sehili, Ziad and Lablans, Martin and Rahm, Erhard}, biburl = {https://puma.scadsai.uni-leipzig.de/bibtex/20f83466133d751aaa8f6cd98fea17de1/scadsfct}, copyright = {http://creativecommons.org/licenses/by/4.0/}, interhash = {5b79a27177181d939f7e5f11db920756}, intrahash = {0f83466133d751aaa8f6cd98fea17de1}, journal = {J. Transl. Med.}, keywords = {Blocking; Locality-sensitive Mainzelliste; Privacy-preserving hashing; linkage record}, language = {en}, month = jan, number = 1, pages = 33, publisher = {Springer Science and Business Media LLC}, timestamp = {2024-09-10T11:54:51.000+0200}, title = {Optimization of the Mainzelliste software for fast privacy-preserving record linkage}, volume = 19, year = 2021 }