Path Query Routing in Unstructured Peer-to-Peer Networks - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

Path Query Routing in Unstructured Peer-to-Peer Networks

Résumé

In this article, we introduce a way to distribute an index database of XML documents on an unstructured peer-to-peer network with a flat topology (i.e. with no super-peer). We then show how to perform content path query routing in such networks. Nodes in the network maintain a set of Multi Level Bloom Filters that summarizes structural properties of XML documents. They propagate part of this information to their neighbor nodes, allowing efficient path query routing in the peer-to-peer network, as shown by the evaluation tests presented.
Fichier principal
Vignette du fichier
MultiLevelEDBF.pdf (184.56 Ko) Télécharger le fichier
Presentation.pdf (791.75 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Format : Autre
Loading...

Dates et versions

hal-00497568 , version 1 (05-07-2010)

Identifiants

Citer

Nicolas Bonnel, Gildas Ménier, Pierre-François Marteau. Path Query Routing in Unstructured Peer-to-Peer Networks. Euro-Par 2007 Parallel Processing, Aug 2007, RENNES, France. pp.479-488, ⟨10.1007/978-3-540-74466-5⟩. ⟨hal-00497568⟩
41 Consultations
221 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More