Efficient processing of continuous join queries using distributed hash tables

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

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

3 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 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.

Original languageEnglish
Title of host publicationEuro-Par 2008 Parallel Processing - 14th International Euro-Par Conference, Proceedings
Pages632-641
Number of pages10
DOIs
StatePublished - 22 Sep 2008
Event14th International Euro-Par Conference, Euro-Par 2008 - Las Palmas de Gran Canaria, Spain
Duration: 26 Aug 200829 Aug 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5168 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference14th International Euro-Par Conference, Euro-Par 2008
CountrySpain
CityLas Palmas de Gran Canaria
Period26/08/0829/08/08

Fingerprint Dive into the research topics of 'Efficient processing of continuous join queries using distributed hash tables'. Together they form a unique fingerprint.

Cite this