Peersum : Gestion des résumés de données dans les systèmes P2P - Archive ouverte HAL Access content directly
Conference Papers Year : 2007

Peersum : Gestion des résumés de données dans les systèmes P2P

(1) , (1) , (1, 2) , (1)


Sharing huge, massively distributed databases in P2P systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer sufficient. A practical approach is to rely on compact database summaries rather than raw database records, whose access is costly in large P2P systems. In this paper, we consider summaries that are synthetic, multidimensional views with two main virtues. First, they can be directly queried and used to approximately answer a query without exploring the original data. Second, as semantic indexes, they support locating relevant nodes based on data content. The main contribution of this paper is to define an efficient algorithm for partitioning an unstructured P2P network into domains, in order to optimally distribute summaries in the network. Then, we propose a distributed algorithm for maintaining a summary in a given domain. Our performance evaluation shows that the cost of query routing is minimized, while incurring a low cost of summary maintenance.
Fichier principal
Vignette du fichier
BDA07.pdf (482.97 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00379723 , version 1 (29-04-2009)


  • HAL Id : hal-00379723 , version 1


Rabab Hayek, Guillaume Raschia, Patrick Valduriez, Noureddine Mouaddib. Peersum : Gestion des résumés de données dans les systèmes P2P. congrès Bases de Données Avancées (BDA'2007), Nov 2007, Marseille, France. pp.60-75. ⟨hal-00379723⟩
191 View
185 Download


Gmail Facebook Twitter LinkedIn More