The Community for Technology Leaders
2013 IEEE 33rd International Conference on Distributed Computing Systems (2007)
Toronto, Canada
June 25, 2007 to June 27, 2007
ISBN: 0-7695-2837-3
pp: 37
Hector Garcia-Molina , Stanford University
Heng Gong , Stanford University
Hideki Kawai , Stanford University
Sutthipong Thavisomboon , Stanford University
Omar Benjelloun , Stanford University
Tait E. Larson , Stanford University
David Menestrina , 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)
Hector Garcia-Molina, Heng Gong, Hideki Kawai, Sutthipong Thavisomboon, Omar Benjelloun, Tait E. Larson, David Menestrina, "D-Swoosh: A Family of Algorithms for Generic, Distributed Entity Resolution", 2013 IEEE 33rd International Conference on Distributed Computing Systems, vol. 00, no. , pp. 37, 2007, doi:10.1109/ICDCS.2007.96
95 ms
(Ver 3.3 (11022016))