Distributed processing of continuous join queries using DHT networks

WENCESLAO ENRIQUE PALMA MUÑOZ, Reza Akbarinia, Esther Pacitti, Patrick Valduriez

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

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.

Original languageEnglish
Title of host publicationProceedings of the 2009 International Conference on Extending Database Technology/International Conference on Database Theory Workshops, EDBT/ICDT '09
Pages34-41
Number of pages8
DOIs
StatePublished - 1 Dec 2009
Event2009 International Conference on Extending Database Technology/International Conference on Database Theory Workshops, EDBT/ICDT '09 - Saint-Petersburg, Russian Federation
Duration: 22 Mar 200922 Mar 2009

Publication series

NameACM International Conference Proceeding Series

Conference

Conference2009 International Conference on Extending Database Technology/International Conference on Database Theory Workshops, EDBT/ICDT '09
CountryRussian Federation
CitySaint-Petersburg
Period22/03/0922/03/09

Cite this