Name
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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1145/1698790.1698798 | EDBT/ICDT Workshops |
Keywords | Field | DocType |
underlying dht link,hash table,multiple dht node,approximate answer,dht network,avoids indexing tuples,network traffic,new method,hash-based placement,performance evaluation,significant performance gain,distributed processing,distributed hash table,indexation | Hash join,Tuple,Workload,Computer science,Search engine indexing,Sort-merge join,Theoretical computer science,Hash function,Distributed computing,Distributed hash table | Conference |
Citations | PageRank | References |
1 | 0.36 | 25 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wenceslao Palma | 1 | 68 | 5.92 |
| Reza Akbarinia | 2 | 254 | 25.77 |
| Esther Pacitti | 3 | 757 | 93.78 |
| Patrick Valduriez | 4 | 3459 | 1306.40 |