title: D-Swoosh: A Family of Algorithms for Generic, Distributed Entity Resolution
creator: Benjelloun, Omar
creator: Garcia-Molina, Hector
creator: Kawai, Hideki
creator: Larson, Tait
creator: Menestrina, David
creator: Thavisomboon, Sutthipong
subject: Image Processing
subject: Mobile Computing
subject: Query Processing
subject: Semistructured Data
description: Entity Resolution (ER) matches and merges records that refer to the same real-world entities, and is typically a compute-intensive process due to complex matching functions and high data volumes.  We present a family of algorithms, D-Swoosh, for distributing the ER workload across multiple processors.  The algorithms use generic match and merge functions, and ensure that new merged records are distributed to processors that may have matching records.  We perform a detailed performance evaluation, for cases where application knowledge can eliminate some comparisons, and for cases where all records must be matched.  Our experiments use actual comparison shopping data provided by Yahoo!.
publisher: Stanford
date: 2006-03
type: Techreport
type: NonPeerReviewed
format: application/pdf
identifier: http://ilpubs.stanford.edu:8090/794/1/2006-8.pdf
identifier: Benjelloun, Omar and Garcia-Molina, Hector and Kawai, Hideki and Larson, Tait and Menestrina, David and Thavisomboon, Sutthipong (2006) D-Swoosh: A Family of Algorithms for Generic, Distributed Entity Resolution. Technical Report. Stanford.
relation: http://ilpubs.stanford.edu:8090/794/