ASPEN: an adaptive spatial peer-to-peer network
Proceedings of the 13th annual ACM international workshop on Geographic information systems
SNet: skip graph based semantic web services discovery
Proceedings of the 2007 ACM symposium on Applied computing
Peer-to-Peer Discovery of Computational Resources for Grid Applications
GRID '05 Proceedings of the 6th IEEE/ACM International Workshop on Grid Computing
RCT: A distributed tree for supporting efficient range and multi-attribute queries in grid computing
Future Generation Computer Systems
Fleet: An Effective System for Publish/Subscribe Service over P2P Networks
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Replica-aware, multi-dimensional range queries in Distributed Hash Tables
Computer Communications
Implementing range queries with a decentralized balanced tree over distributed hash tables
NBiS'07 Proceedings of the 1st international conference on Network-based information systems
eCube: hypercube event for efficient filtering in content-based routing
OTM'07 Proceedings of the 2007 OTM confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part II
Fault-tolerant query processing in structured P2P-systems
Distributed and Parallel Databases
Query based clustering method in structured P2P overlay networks
CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference
Zone indexing: Optimizing the balance between searching and indexing in a loosely structured overlay
Computer Networks: The International Journal of Computer and Telecommunications Networking
A flabellate overlay network for multi-attribute search
Journal of Parallel and Distributed Computing
An improved lookup algorithm on over-DHT paradigm based P2P network
WISM'11 Proceedings of the 2011 international conference on Web information systems and mining - Volume Part I
RAQ: a range-queriable distributed data structure
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
P2P consistency support for large-scale interactive applications
Computer Networks: The International Journal of Computer and Telecommunications Networking
Processing top-k queries in distributed hash tables
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Decentralized resource discovery mechanisms for distributed computing in peer-to-peer environments
ACM Computing Surveys (CSUR)
XL peer-to-peer pub/sub systems
ACM Computing Surveys (CSUR)
Hi-index | 0.00 |
In recent years, Distributed Hash Tables (DHTs) have been proposed as a fundamental building block for large scale distributed applications. Important functionalities such as searching have been added to the DHT's basic lookup capability. However, supporting range queries efficiently remains a difficult problem. In this paper, we describe an adaptive mechanism that relies on a logical tree data structure, the Range Search Tree (RST), to support range queries efficiently. Nodes in the RST automatically group registrations based on their values. Queries are decomposed into a small number of sub-queries for efficient resolution. The system dynamically optimizes itself to minimize the registration and query cost based on observed load. The system is fully distributed and avoids bottleneck problems encountered in traditional tree-based systems. Extensive simulation results validate the effectiveness of the system.