Scalable Iterative Graph Duplicate Detection

Abstract : Duplicate detection determines 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. We scale-up duplicate detection in graph data (ddg) to large amounts of data and pairwise comparisons, using the support of a relational database management system. To this end, we first present a framework that generalizes the ddg process. We then present algorithms to scale ddg in space (amount of data processed with bounded main memory) and in time. Finally, we extend our framework to allow batched and parallel ddg, thus further improving efficiency. Experiments on data of up to two orders of magnitude larger than data considered so far in ddg show that our methods achieve the goal of scaling ddg to large volumes of data.
Document type :
Journal articles
Complete list of metadatas

Cited literature [29 references]  Display  Hide  Download

https://hal.inria.fr/hal-00757604
Contributor : Melanie Herschel <>
Submitted on : Tuesday, November 27, 2012 - 11:53:44 AM
Last modification on : Monday, May 28, 2018 - 2:38:02 PM
Long-term archiving on : Thursday, February 28, 2013 - 3:43:30 AM

File

TKDE2012a_herschel.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-00757604, version 1

Collections

Citation

Melanie Herschel, Felix Naumann, Sascha Szott, Maik Taubert. Scalable Iterative Graph Duplicate Detection. IEEE Transactions on Knowledge and Data Engineering, Institute of Electrical and Electronics Engineers, 2012, 24 (11), pp.2094-2108. ⟨hal-00757604⟩

Share

Metrics

Record views

420

Files downloads

1391