Entity Resolution for Distributed Probabilistic Data - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles Distributed and Parallel Databases Year : 2013

Entity Resolution for Distributed Probabilistic Data

Naser Ayat
  • Function : Author
  • PersonId : 932772
Reza Akbarinia
Hamideh Afsarmanesh
  • Function : Author
  • PersonId : 932773


The problem of entity resolution over probabilistic data (ERPD) arises in many applications that have to deal with probabilistic data. In many of these applications, probabilistic data is distributed among a number of nodes. The simple, centralized approach to the ERPD problem does not scale well as large amounts of data need to be sent to a central node. In this paper, we present FD, a fully distributed algorithm for dealing with the ERPD problem over distributed data, with the goal of minimizing bandwidth usage and reducing processing time. FD is completely distributed and does not depends on the existence of certain nodes. We validated FD through implementation over a 75-node cluster. We used both synthetic and real-world data in our experiments. Our performance evaluation shows that FD can achieve major performance gains in terms of bandwidth usage and response time.
Fichier principal
Vignette du fichier
D-ERUD.pdf (448.97 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

lirmm-00879631 , version 1 (04-11-2013)



Naser Ayat, Reza Akbarinia, Hamideh Afsarmanesh, Patrick Valduriez. Entity Resolution for Distributed Probabilistic Data. Distributed and Parallel Databases, 2013, 31 (4), pp.509-542. ⟨10.1007/s10619-013-7129-3⟩. ⟨lirmm-00879631⟩
331 View
570 Download



Gmail Facebook X LinkedIn More