Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/857
Title: Delay-bounded range queries in DHT-based peer-to-peer systems
Authors: Li, Dongsheng
Cao, Jiannong
Lu, Xicheng
Chan, Keith C. C.
Wang, Baosheng
Su, Jinshu
Leong, Hong-va
Chan, Alvin T. S.
Subjects: Information systems
Data management
Query processing
Query formulation
Performance evaluation
Simulation output analysis
Issue Date: 2006
Publisher: IEEE
Source: ICDCS 2006 : 26th IEEE International Conference on Distributed Computing Systems, 4-7 July 2006, Lisboa, Portugal, p. 64-71
Abstract: Many general range query schemes for DHT-based peer-to-peer (P2P) systems have been proposed, which do not need to modify the underlying DHTs, However, most existing works 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 general range query scheme to support single-attribute and multiple-attribute range queries. Armada is the first delay-bounded range query scheme over 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 of 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.
Rights: © 2006 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: Conference Paper
URI: http://hdl.handle.net/10397/857
ISBN: 0769525407
ISSN: 1063-6927
Appears in Collections:COMP Conference Papers & Presentations

Files in This Item:
File Description SizeFormat 
delay-bounded_06.pdf306.03 kBAdobe 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.