Skip to Main content Skip to Navigation
Journal articles

Efficient Processing of Continuous Join Queries using Distributed Hash Tables

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 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.
Document type :
Journal articles
Complete list of metadata

https://hal.inria.fr/inria-00368874
Contributor : Wenceslao Palma Connect in order to contact the contributor
Submitted on : Tuesday, March 17, 2009 - 6:36:01 PM
Last modification on : Wednesday, April 27, 2022 - 4:10:41 AM
Long-term archiving on: : Tuesday, June 8, 2010 - 11:35:06 PM

File

DHTJoin.pdf
Files produced by the author(s)

Identifiers

Citation

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

Share

Metrics

Record views

64

Files downloads

175