DMCA
Scalable, Efficient Range Queries for Grid Information Services (2002)
by
Artur Andrzejak
,
Zhichen Xu
| Citations: | 22 - 0 self |
BibTeX
@MISC{Andrzejak02scalable,efficient,
author = {Artur Andrzejak and Zhichen Xu},
title = {Scalable, Efficient Range Queries for Grid Information Services},
year = {2002}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Recent Peer-to-Peer (P2P) systems such as Tapestry, Chord or CAN act primarily as a Distributed Hash Table (DHT). A DHT is a data structure for distributed storing of pairs (key, data) which allows fast locating of data when a key is given. To facilitate efficient queries on a range of keys, we propose a CAN-based extension of this DHT-functionality. The design of our extension suggests several range query strategies
