Speeding up Privacy Preserving Record Linkage for Metric Space Similarity Measures
| dc.contributor.author | Sehili, Ziad | |
| dc.contributor.author | Rahm, Erhard | |
| dc.date.accessioned | 2018-01-10T13:20:52Z | |
| dc.date.available | 2018-01-10T13:20:52Z | |
| dc.date.issued | 2016 | |
| dc.description.abstract | The analysis of person-related data in Big Data applications faces the tradeoff of finding useful results while preserving a high degree of privacy. This is especially challenging when person-related data from multiple sources need to be integrated and analyzed. Privacy-preserving record linkage (PPRL) addresses this problem by encoding sensitive attribute values such that the identification of persons is prevented but records can still be matched. In this paper we study how to improve the efficiency and scalability of PPRL by restricting the search space for matching encoded records. We focus on similarity measures for metric spaces and investigate the use of M‑trees as well as pivot-based solutions. Our evaluation shows that the new schemes outperform previous filter approaches by an order of magnitude. | |
| dc.identifier.pissn | 1610-1995 | |
| dc.identifier.uri | https://dl.gi.de/handle/20.500.12116/11791 | |
| dc.publisher | Springer | |
| dc.relation.ispartof | Datenbank-Spektrum: Vol. 16, No. 3 | |
| dc.relation.ispartofseries | Datenbank-Spektrum | |
| dc.subject | Bloom Filter | |
| dc.subject | M-Tree | |
| dc.subject | Metric Space | |
| dc.subject | Record Linkage | |
| dc.subject | Triangle Inequality | |
| dc.title | Speeding up Privacy Preserving Record Linkage for Metric Space Similarity Measures | |
| dc.type | Text/Journal Article | |
| gi.citation.endPage | 236 | |
| gi.citation.startPage | 227 |