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 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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-85451-7_67 | Euro-Par |
Keywords | Field | DocType |
efficient processing,continuous join,hash table,hash tables,gossip style protocol,approximate answer,network traffic,new method,hash-based placement,performance evaluation,significant performance gain,distributed hash table | Hash join,Hash tree,Double hashing,Computer science,Theoretical computer science,Merkle tree,Hash function,Hash chain,Dynamic perfect hashing,Hash list,Distributed computing | Conference |
Volume | ISSN | Citations |
5168 | 0302-9743 | 3 |
PageRank | References | Authors |
0.37 | 21 | 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 |