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.
Domaines
Base de données [cs.DB]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|