Duplicate detection consists in determining different representations of real-world objects in a database. Recent research has considered the use of relationships among object representations to improve duplicate detection. In the general case where relationships form a graph, research has mainly focused on duplicate detection quality/effectiveness. Scalability has been neglected so far, even though it is crucial for large real-world duplicate detection tasks.
In this paper we scale up duplicate detection in graph data (DDG) to large amounts of data and pairwise comparisons, using the support of a relational database system. To this end, we first generalize the process of DDG. We then present how to scale algorithms for DDG in space (amount of data processed with limited main memory) and in time. Finally, we explore how complex similarity computation can be performed efficiently. Experiments on data an order of magnitude larger than data considered so far in DDG clearly show that our methods scale to large amounts of data not residing in main memory.
| Identifer | oai:union.ndltd.org:Potsdam/oai:kobv.de-opus-ubp:3285 |
| Date | January 2008 |
| Creators | Herschel, Melanie, Naumann, Felix |
| Publisher | Universität Potsdam, An-Institute. Hasso-Plattner-Institut für Softwaresystemtechnik GMBH |
| Source Sets | Potsdam University |
| Language | English |
| Detected Language | English |
| Type | Book |
| Format | application/pdf |
| Rights | http://opus.kobv.de/ubp/doku/urheberrecht.php |
Page generated in 0.0022 seconds