Continuous multi-way joins over distributed hash tables

This paper studies the problem of evaluating continuous multi-way joins on top of Distributed Hash Tables (DHTs). We present a novel algorithm, called recursive join (RJoin), that takes into account various parameters crucial in a distributed setting i.e., network traffic, query processing load distribution, storage load distribution etc. The key idea of RJoin is incremental evaluation: as relevant tuples arrive continuously, a given multi-way join is rewritten continuously into a join with fewer join operators, and is assigned continuously to different nodes of the network. In this way, RJoin distributes the responsibility of evaluating a continuous multi-way join to many network nodes by assigning parts of the evaluation of each binary join to a different node depending on the values of the join attributes. The actual nodes to be involved are decided by RJoin dynamically after taking into account the rate of incoming tuples with values equal to the values of the joined attributes. R...

• Type: Conference
• Year: 2008
• Where: EDBT
• Authors: Stratos Idreos, Erietta Liarou, Manolis Koubarakis
• Keywords: Continuous Multi-way Join, Continuous Multi-way Joins, Database, EDBT 2008, Fewer Join Operators