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.
| BibTeX | DublinCore | EndNote | HTML |
 | There is a more recent version of this item available. |
![[img]](/style/images/fileicons/application_pdf.png)
| PDF 299Kb |
Abstract
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!.
| Item Type: | Techreport (Technical Report) | |
|---|---|---|
| Subjects: | Computer Science > Image Processing Computer Science > Mobile Computing Computer Science > Query Processing Computer Science > Semistructured Data | |
| Projects: | Miscellaneous | |
| Related URLs: | Project Homepage | http://infolab.stanford.edu/ |
| ID Code: | 794 | |
| Deposited By: | Import Account | |
| Deposited On: | 14 Mar 2006 16:00 | |
| Last Modified: | 18 Dec 2008 14:41 |
Available Versions of this Item
- D-Swoosh: A Family of Algorithms for Generic, Distributed Entity Resolution. (deposited 14 Mar 2006 16:00) [Currently Displayed]
Download statistics
Repository Staff Only: item control page
