This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
27th International Conference on Distributed Computing Systems (ICDCS '07)
D-Swoosh: A Family of Algorithms for Generic, Distributed Entity Resolution
Toronto, Canada
June 25-June 27
ISBN: 0-7695-2837-3
Omar Benjelloun, Stanford University
Hector Garcia-Molina, Stanford University
Heng Gong, Stanford University
Hideki Kawai, Stanford University
Tait E. Larson, Stanford University
David Menestrina, Stanford University
Sutthipong Thavisomboon, Stanford University
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 on a testbed of 15 processors. Our experiments use actual comparison shopping data provided by Yahoo!. (keywords: Entity Resolution, Information Integration, Data Cleaning)
Index Terms:
orig-research
Citation:
Omar Benjelloun, Hector Garcia-Molina, Heng Gong, Hideki Kawai, Tait E. Larson, David Menestrina, Sutthipong Thavisomboon, "D-Swoosh: A Family of Algorithms for Generic, Distributed Entity Resolution," icdcs, pp.37, 27th International Conference on Distributed Computing Systems (ICDCS '07), 2007
Usage of this product signifies your acceptance of the Terms of Use.