Please use this identifier to cite or link to this item:
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Computing-
dc.creatorLi, D-
dc.creatorCao, J-
dc.creatorLu, X-
dc.creatorChan, KCC-
dc.creatorWang, B-
dc.creatorSu, J-
dc.creatorLeong, HV-
dc.creatorChan, ATS-
dc.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.en_US
dc.rightsThis 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.en_US
dc.subjectInformation systemsen_US
dc.subjectData managementen_US
dc.subjectQuery processingen_US
dc.subjectQuery formulationen_US
dc.subjectPerformance evaluationen_US
dc.subjectSimulation output analysisen_US
dc.titleDelay-bounded range queries in DHT-based peer-to-peer systemsen_US
dc.typeConference Paperen_US
dcterms.abstractMany 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.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationICDCS 2006 : 26th IEEE International Conference on Distributed Computing Systems, 4-7 July 2006, Lisboa, Portugal, p. 64-71-
dc.relation.ispartofbookICDCS 2006 : 26th IEEE International Conference on Distributed Computing Systems, 4-7 July 2006, Lisboa, Portugal-
dc.relation.conferenceInternational Conference on Distributed Computing Systems [ICDCS]-
dc.description.ros2006-2007 > Academic research: refereed > Refereed conference paper-
dc.description.oaVersion of Recorden_US
Appears in Collections:Conference Paper
Files in This Item:
File Description SizeFormat 
delay-bounded_06.pdf306.03 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

Last Week
Last month
Citations as of Sep 24, 2023


Citations as of Sep 24, 2023


Last Week
Last month
Citations as of Sep 28, 2023

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.