DMCA
Range Queries over DHTs (2003)
Cached
Download Links
| Citations: | 29 - 1 self |
BibTeX
@MISC{Ratnasamy03rangequeries,
author = {Sylvia Ratnasamy and Sylvia Ratnasamy and Joseph M. Hellerstein and Joseph M. Hellerstein and Scott Shenker and Scott Shenker},
title = {Range Queries over DHTs},
year = {2003}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Distributed Hash Tables (DHTs) are scalable peer-to-peer systems that support exact match lookups. This paper describes the construction and use of a Prefix Hash Tree (PHT) -- a distributed data structure that supports range queries over DHTs. PHTs use the hash-table interface of DHTs to construct a search tree that is efficient (insertions/lookups take ##### ### #### DHT lookups, where D is the data domain being indexed) and robust (the failure of any given node in the search tree does not affect the availability of data stored at other nodes in the PHT).
