Efficient Processing of Continuous Join Queries Using Distributed Hash Tables

  • Authors:
  • Wenceslao Palma;Reza Akbarinia;Esther Pacitti;Patrick Valduriez

  • Affiliations:
  • Atlas Team, INRIA and LINA, University of Nantes, France;School of Computer Science, University of Waterloo, Canada;Atlas Team, INRIA and LINA, University of Nantes, France;Atlas Team, INRIA and LINA, University of Nantes, France

  • Venue:
  • Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

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.