Distributed Processing of Continous Join Queries using DHT Networks

Abstract : 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 exploiting the trees formed by the underlying DHT links. DHTJoin distributes the query workload across multiple DHT nodes and provides a mechanism that avoids indexing tuples that cannot contribute to join results. We provide a performance evaluation which shows that DHTJoin can achieve significant performance gains in terms of network traffic.
Type de document :
Communication dans un congrès
ACM. 2nd International Workshop on Data Management in Peer-to-Peer Systems (DAMAP), Mar 2009, Saint-Petersbourg, Russia. Vol. 360, pp.34-41, 2009, ACM International Conference Proceeding Series
Liste complète des métadonnées

Littérature citée [26 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00375277
Contributeur : Wenceslao Palma <>
Soumis le : vendredi 21 août 2009 - 02:24:07
Dernière modification le : mercredi 11 avril 2018 - 01:56:47
Document(s) archivé(s) le : samedi 26 novembre 2016 - 11:18:05

Fichier

DHTJoinDAMAP09-INRIA.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00375277, version 2

Collections

Citation

Wenceslao Palma, Reza Akbarinia, Esther Pacitti, Patrick Valduriez. Distributed Processing of Continous Join Queries using DHT Networks. ACM. 2nd International Workshop on Data Management in Peer-to-Peer Systems (DAMAP), Mar 2009, Saint-Petersbourg, Russia. Vol. 360, pp.34-41, 2009, ACM International Conference Proceeding Series. 〈inria-00375277v2〉

Partager

Métriques

Consultations de la notice

288

Téléchargements de fichiers

106