Prefix Hash Tree: An Indexing Data Structure over Distributed Hash Tables (2004)
Cached
Download Links
- [berkeley.intel-research.net]
- [www.eecs.berkeley.edu]
- CiteULike
Other Repositories/Bibliography
| Citations: | 19 - 0 self |
BibTeX
@TECHREPORT{Ramabhadran04prefixhash,
author = {Sriram Ramabhadran and Sylvia Ratnasamy and Joseph M. Hellerstein and Scott Shenker},
title = {Prefix Hash Tree: An Indexing Data Structure over Distributed Hash Tables},
institution = {},
year = {2004}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Distributed Hash Tables are scalable, robust, and self-organizing peer-to-peer systems that support exact match lookups. This paper describes the design and implementation of a Prefix Hash Tree - a distributed data structure that enables more sophisticated queries over a DHT. The Prefix Hash Tree uses the lookup interface of a DHT to construct a trie-based structure that is both e#cient (updates are doubly logarithmic in the size of the domain being indexed), and resilient (the failure of any given node in the Prefix Hash Tree does not a#ect the availability of data stored at other nodes).
