Issue No.01 - January (2009 vol.21)
Dongsheng Li , National University of Defense Technology, Changsha, China
Xicheng Lu , National University of Defense Technology, Changsha, China
Keith C. C. Chen , The Hong Kong Polytechnic University
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2008.99
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.
peer-to-peer, distributed hash table (DHT), range queries
Dongsheng Li, Xicheng Lu, Keith C. C. Chen, "Efficient Range Query Processing in Peer-to-Peer Systems", IEEE Transactions on Knowledge & Data Engineering, vol.21, no. 1, pp. 78-91, January 2009, doi:10.1109/TKDE.2008.99