Efficient Processing of Continuous Join Queries using Distributed Hash Tables - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Lecture Notes in Computer Science Année : 2008

Efficient Processing of Continuous Join Queries using Distributed Hash Tables

Résumé

This paper addresses the problem of computing approximate answers to continuous join queries. We present a new method, called DHTJoin, which combines hash-based placement of tuples in a Distributed Hash Table (DHT) and dissemination of queries using a gossip style protocol. We provide a performance evaluation of DHTJoin which shows that DHTJoin can achieve significant performance gains in terms of network traffic.
Fichier principal
Vignette du fichier
DHTJoin.pdf (309.17 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

inria-00368874 , version 1 (17-03-2009)

Identifiants

Citer

Wenceslao Palma, Reza Akbarinia, Esther Pacitti, Patrick Valduriez. Efficient Processing of Continuous Join Queries using Distributed Hash Tables. Lecture Notes in Computer Science, 2008, Euro-Par 2008 – Parallel Processing, Volume 5168/2008, pp.632-641. ⟨10.1007/978-3-540-85451-7_67⟩. ⟨inria-00368874⟩
72 Consultations
188 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More