nantes.fr

This paper addresses the problem of computing approxi-mate answers to continuous join queries. We present a new method, called DHTJoin, which combines hash-based place-ment of tuples in a Distributed Hash Table (DHT) and dis-semination of queries exploiting the trees formed by the un-derlying DHT links. DHTJoin distributes the query work-load 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. 1