Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/828
Title: Efficient range query processing in peer-to-peer systems
Authors: Li, Dongsheng
Cao, Jiannong
Lu, Xicheng
Chan, Keith C. C.
Subjects: Peer-to-peer computing
Distributed hash table (DHT)
Delay bounded
Range query
Issue Date: Jan-2009
Publisher: IEEE Computer Society
Source: IEEE transactions on knowledge and data engineering, Jan. 2009, v. 21, no. 1, p. 78-91.
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 support range query without modifying the underlying DHTs, they cannot guarantee to return the query results with bounded delay. The query delay in these schemes depends on both the scale of the system and the size of the query space or the specific query. In this paper, we propose Armada, an efficient range query processing scheme to support delay-bounded single-attribute and multiple-attribute range queries. We first describe the order-preserving naming algorithms for assigning adjoining ObjectIDs to objects with close attribute values. Then, we present the design of the forwarding tree to efficiently match the search paths of range queries to the underlying DHT topology. Based on the tree, two query processing algorithms are proposed to, respectively, process single-attribute and multiple-attribute range queries within a bounded delay. Analytical and simulation results show that Armada is an effective general range query scheme on constant-degree DHTs, and can return the query results within 2 logN hops in a P2P system with N peers, regardless of the queried range or the size of query space.
Rights: © 2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
Type: Journal/Magazine Article
URI: http://hdl.handle.net/10397/828
DOI: 10.1109/TKDE.2008.99
ISSN: 1041-4347
Appears in Collections:COMP Journal/Magazine Articles

Files in This Item:
File Description SizeFormat 
query-processing_09.pdf3.53 MBAdobe PDFView/Open


All items in the PolyU Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated. No item in the PolyU IR may be reproduced for commercial or resale purposes.