Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/828
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.date.accessioned2014-12-11T08:24:18Z-
dc.date.available2014-12-11T08:24:18Z-
dc.identifier.issn1041-4347-
dc.identifier.urihttp://hdl.handle.net/10397/828-
dc.language.isoenen_US
dc.publisherInstitute of Electrical and Electronics Engineersen_US
dc.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.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.subjectPeer-to-peer computingen_US
dc.subjectDistributed hash table (DHT)en_US
dc.subjectDelay boundeden_US
dc.subjectRange queryen_US
dc.titleEfficient range query processing in peer-to-peer systemsen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage78-
dc.identifier.epage91-
dc.identifier.volume21-
dc.identifier.issue1-
dc.identifier.doi10.1109/TKDE.2008.99-
dcterms.abstractWith 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.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationIEEE transactions on knowledge and data engineering, Jan. 2009, v. 21, no. 1, p. 78-91-
dcterms.isPartOfIEEE transactions on knowledge and data engineering-
dcterms.issued2009-01-
dc.identifier.isiWOS:000260999100006-
dc.identifier.scopus2-s2.0-57049159355-
dc.identifier.eissn1558-2191-
dc.identifier.rosgroupidr42647-
dc.description.ros2008-2009 > Academic research: refereed > Publication in refereed journal-
dc.description.oaVersion of Recorden_US
dc.identifier.FolderNumberOA_IR/PIRAen_US
dc.description.pubStatusPublisheden_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
query-processing_09.pdf3.53 MBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

121
Last Week
2
Last month
Citations as of Mar 24, 2024

Downloads

426
Citations as of Mar 24, 2024

SCOPUSTM   
Citations

53
Last Week
0
Last month
1
Citations as of Mar 28, 2024

WEB OF SCIENCETM
Citations

40
Last Week
0
Last month
0
Citations as of Mar 28, 2024

Google ScholarTM

Check

Altmetric


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