Efficient Range Query Processing in Peer-to-Peer Systems

Authors:
Dongsheng Li;Jiannong Cao;Xicheng Lu;Keith C. C. Chen
Affiliations:
National University of Defense Technology, Changsha, China;The Hong Kong Polytechnic University;National University of Defense Technology, Changsha, China;The Hong Kong Polytechnic University
Venue:
IEEE Transactions on Knowledge and Data Engineering
Year:
2009

Citing 0
Cited 7

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
PonD: dynamic creation of HTC pool on demand using a decentralized resource discovery system

Proceedings of the 21st international symposium on High-Performance Parallel and Distributed Computing
Internet-based Virtual Computing Environment: Beyond the data center as a computer

Future Generation Computer Systems
An efficient resource allocation for maximizing benefit of users and resource providers in ad hoc grid environment

Information Systems Frontiers
MatchTree: Flexible, scalable, and fault-tolerant wide-area resource discovery with distributed matchmaking and aggregation

Future Generation Computer Systems
Self-Organized Formation and Evolution of Peer-to-Peer Networks

INFORMS Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

With the increasing popularity of the peer-to-peer (P2P) computing paradigm, many general range query schemes for distributed hash table (DHT)-based P2P systems have been proposed in recent years. Although those schemes can provide range query capability without modifying the underlying DHTs, they have the query delay depending on both the scale of the system and the size of the query space or the specific query, and thus cannot guarantee to return the query results in a bounded delay. In this paper, we propose Armada, an efficient range query processing scheme to support delay-bounded single-attribute and multiple-attribute range queries. It is the first delay-bounded general range query scheme on constant-degree DHTs, and can return the results for any range query within 2logN hops in a P2P system with N peers. Results of analysis and simulations show that the average delay in Armada is less than logN, and the average message cost of single-attribute range queries is about logN+2n 2 (n is the number of peers that intersect with the query). These results are very close to the lower bounds on delay and message cost of range queries over constant-degree DHTs.