Beschreibung

Privacy-preserving record linkage (PPRL) becomes increasingly important to match and integrate records with sensitive data. PPRL not only has to preserve the anonymity of the persons or entities involved but should also be highly efficient and scalable to large datasets. We therefore investigate how to adapt PPJoin, one of the fastest approaches for regular record linkage, to PPRL resulting in a new approach called P4Join. The use of bit vectors for PPRL also allows us to devise a parallel execution of P4Join on GPUs. We evaluate the new approaches and compare their efficiency with a PPRL approach based on multibit trees.

BibTex

@inproceedings{DBLP:conf/btw/SehiliKBSR15,
  author    = {Ziad Sehili and
               Lars Kolb and
               Christian Borgs and
               Rainer Schnell and
               Erhard Rahm},
  title     = {Privacy Preserving Record Linkage with PPJoin},
  booktitle = {Datenbanksysteme f{\"{u}}r Business, Technologie und Web (BTW),
               16. Fachtagung des GI-Fachbereichs "Datenbanken und Informationssysteme"
               (DBIS), 4.-6.3.2015 in Hamburg, Germany. Proceedings},
  pages     = {85--104},
  year      = {2015},
  crossref  = {DBLP:conf/btw/2015},
  timestamp = {Fri, 20 Mar 2015 18:46:10 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/btw/SehiliKBSR15},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}