Supporting Multi-dimensional Range Query in HD Tree

There are two basic concerns for supporting multi-dimensional range query in P2P overlay networks. The first is to preserve data locality in the process of data space partitioning, and the second is the maintenance of data locality among data items with an exponentially expanding rate and an exponen...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2010 IEEE/ACM 14th International Symposium on Distributed Simulation and Real Time Applications s. 71 - 78
Hlavní autori: Yunfeng Gu, Boukerche, A, Xun Ye, Araujo, R B
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.10.2010
Predmet:
Algorithm design and analysis
associative searching
data space partitioning
Data structures
DDM
distributed
Distributed databases
HD Tree
High definition video
multi-dimensional
overlay
P2P
Pattern matching
Peer to peer computing
peer-to-peer
range query
Routing
ISBN:1424486513, 9781424486519
ISSN:1550-6525
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract There are two basic concerns for supporting multi-dimensional range query in P2P overlay networks. The first is to preserve data locality in the process of data space partitioning, and the second is the maintenance of data locality among data items with an exponentially expanding rate and an exponentially extending rate. The first problem has been well addressed by using recursive decomposition schemes, such as Quad tree, K-d tree, Z-order, and Hilbert curve. While the second problem was recently identified by our novel data structure: HD Tree. This paper is a follow-up to our previous work in HD Tree. In this paper, we explore how data locality can be easily maintained, and how range query can be efficiently supported in HD Tree. This is done by introducing two basic routing strategies, hierarchical routing and distributed routing. Although hierarchical routing can be applied to any two nodes in the system, it generates high volume traffic towards nodes near the root, and has very limited options to cope with a node failure. On the other hand, distributed routing concerns source and destination pairs only at the same depth, but traffic load is bound to some nodes at two neighboring depths, and multiple options can be found to redirect a routing request. Because HD Tree supports multiple routes between any two nodes in the system, routing in HD Tree is very flexible, and can be designed for many purposes, like fault tolerance, or dynamic load balancing. Distributed Routing Oriented Combined Routing algorithm is one such routing strategies implemented so far. It is a hybrid algorithm combining advantages from both the hierarchical routing and the distributed routing. The experimental results show that the DROCR algorithm achieves considerable performance gain over the equivalent tree routing at the highest depth examined. In the experiment of supporting multi-dimensional range query, we employ the Z-order space filling curve over the HD Tree overlay layer. We are expecting that the performance of range query will vary proportionally with the change of range size, and reasonably with the increase of dimensionality.
AbstractList There are two basic concerns for supporting multi-dimensional range query in P2P overlay networks. The first is to preserve data locality in the process of data space partitioning, and the second is the maintenance of data locality among data items with an exponentially expanding rate and an exponentially extending rate. The first problem has been well addressed by using recursive decomposition schemes, such as Quad tree, K-d tree, Z-order, and Hilbert curve. While the second problem was recently identified by our novel data structure: HD Tree. This paper is a follow-up to our previous work in HD Tree. In this paper, we explore how data locality can be easily maintained, and how range query can be efficiently supported in HD Tree. This is done by introducing two basic routing strategies, hierarchical routing and distributed routing. Although hierarchical routing can be applied to any two nodes in the system, it generates high volume traffic towards nodes near the root, and has very limited options to cope with a node failure. On the other hand, distributed routing concerns source and destination pairs only at the same depth, but traffic load is bound to some nodes at two neighboring depths, and multiple options can be found to redirect a routing request. Because HD Tree supports multiple routes between any two nodes in the system, routing in HD Tree is very flexible, and can be designed for many purposes, like fault tolerance, or dynamic load balancing. Distributed Routing Oriented Combined Routing algorithm is one such routing strategies implemented so far. It is a hybrid algorithm combining advantages from both the hierarchical routing and the distributed routing. The experimental results show that the DROCR algorithm achieves considerable performance gain over the equivalent tree routing at the highest depth examined. In the experiment of supporting multi-dimensional range query, we employ the Z-order space filling curve over the HD Tree overlay layer. We are expecting that the performance of range query will vary proportionally with the change of range size, and reasonably with the increase of dimensionality.
Author Araujo, R B
Boukerche, A
Yunfeng Gu
Xun Ye
Author_xml – sequence: 1
  surname: Yunfeng Gu
  fullname: Yunfeng Gu
  email: yungu@site.uottawa.ca
  organization: PARADISE Res. Lab., Univ. of Ottawa, Ottawa, ON, Canada
– sequence: 2
  givenname: A
  surname: Boukerche
  fullname: Boukerche, A
  email: boukerch@site.uottawa.ca
  organization: PARADISE Res. Lab., Univ. of Ottawa, Ottawa, ON, Canada
– sequence: 3
  surname: Xun Ye
  fullname: Xun Ye
  email: xye063@site.uottawa.ca
  organization: PARADISE Res. Lab., Univ. of Ottawa, Ottawa, ON, Canada
– sequence: 4
  givenname: R B
  surname: Araujo
  fullname: Araujo, R B
  email: regina@dc.ufscar.br
  organization: Comput. Sci. Dept., Fed. Univ. of Sao Carlos, Sao Carlos, Brazil
BookMark eNotjrFOwzAURS1RJJrCyMTiH3Cx_ew4GVELFKkI0Ya5cuyXyih1IicZ-vcUwXR1znB0MzKLXURC7gVfCsHLx_We7aql5L9srkgmlFSqyLWAGZkLrTnLtdQ3JBuGb84V8ALmBPZT33dpDPFI36d2DMyHE8YhdNG2dGfjEennhOlMQ6SbNa0S4i25bmw74N3_LsjXy3O12rDtx-vb6mnLrFQwskb72nAwqCQYbx0K6VxjVekvnwos89qDqFE2XLrSwkV74VWpvJG1dc7Agjz8dQMiHvoUTjadDzqH3AgOP9BRRUI
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/DS-RT.2010.17
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Xplore
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EndPage 78
ExternalDocumentID 5636710
Genre orig-research
GroupedDBID 123
29O
6IE
6IF
6IH
6IK
6IL
6IM
6IN
AAJGR
AAWTH
ACGFS
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
APO
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IJVOP
IPLJI
M43
OCL
RIE
RIL
ID FETCH-LOGICAL-a243t-f5db7037e4237dace12ccfa49d6518e96bd31be2f02c9a39d6d1d494d72bacc73
IEDL.DBID RIE
ISBN 1424486513
9781424486519
ISICitedReferencesCount 1
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000286937500009&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1550-6525
IngestDate Wed Aug 27 02:51:46 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a243t-f5db7037e4237dace12ccfa49d6518e96bd31be2f02c9a39d6d1d494d72bacc73
PageCount 8
ParticipantIDs ieee_primary_5636710
PublicationCentury 2000
PublicationDate 2010-Oct.
PublicationDateYYYYMMDD 2010-10-01
PublicationDate_xml – month: 10
  year: 2010
  text: 2010-Oct.
PublicationDecade 2010
PublicationTitle 2010 IEEE/ACM 14th International Symposium on Distributed Simulation and Real Time Applications
PublicationTitleAbbrev ds-rt
PublicationYear 2010
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0043083
ssj0000452490
Score 1.7752898
Snippet There are two basic concerns for supporting multi-dimensional range query in P2P overlay networks. The first is to preserve data locality in the process of...
SourceID ieee
SourceType Publisher
StartPage 71
SubjectTerms Algorithm design and analysis
associative searching
data space partitioning
Data structures
DDM
distributed
Distributed databases
HD Tree
High definition video
multi-dimensional
overlay
P2P
Pattern matching
Peer to peer computing
peer-to-peer
range query
Routing
Title Supporting Multi-dimensional Range Query in HD Tree
URI https://ieeexplore.ieee.org/document/5636710
WOSCitedRecordID wos000286937500009&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ07T8MwFIWvSsXAxKNFvOWBEdPEduxkplQdUFVKQd0qx75BXVIUWiT-PbaTtkJiYUs8xfHb957vANzmLNUiL1KqeRRRIZmlmbAxVRozG6EwLHC2357UaJTOZtm4BXdbLQwihuQzvPePIZZvl2btr8p6ieRSeT3VnlKy1mpt71M8Glz4iE89CwseBQSn34FTmbBkI-pKZTAbrFlPzXu2g2_2-i90Mq1TvuLflithxRkc_u9bj6C7k-6R8XZROoYWlidwuPFuIM1Q7gD3dp5LjxB4J0GES63n_NeMDjLxkgPyvMbqmyxKMuyTaYXYhdfB4_RhSBsDBaqZ4CtaJDZ3I1qhz32x2mDMjCm0yKyrdIqZzC2Pc2RFxEymuSu2sRWurRTLtTGKn0K7XJZ4BsSDzqyQaFMhBLpTWuzmReZVuq4XaB2dQ8f_g_lHzciYN9W_-Lv4Eg5CFD4kxV1Be1Wt8Rr2zddq8VndhIb9ATB-nEQ
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ3NT8IwGMbfEDTREyoYv-3Bo5Wt7brtLBKMSBCn4Ua69p3hMswEE_97125CTLx423pa1---7_N7AK5SFimRZhFV3POokMzQWBifhgpj46HQzHG2X4fhaBRNp_G4AddrLQwiuuQzvLGPLpZvFnplr8q6geQytHqqrUAI5lVqrfWNioWDCxvzqeZhwT0H4bR7cCoDFvzIuiLp7AYr2lP9Hm_wm93eM50kVdKX_9t0xa05_db_vnYPOhvxHhmvl6V9aGB-AK0f9wZSD-Y2cGvoubAQgTfiZLjUWNJ_RekgEys6IE8rLL7IPCeDHkkKxA689O-S2wGtLRSoYoIvaRaYtBzTIdrsF6M0-kzrTInYlJWOMJap4X6KLPOYjhUvi41vRNlaIUuV1iE_hGa-yPEIiEWdGSHRREIILM9pfjkzMqvTLfuBUt4xtO0_mL1XlIxZXf2Tv4svYWeQPA5nw_vRwynsupi8S5E7g-ayWOE5bOvP5fyjuHCN_A2KgZ-L
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2010+IEEE%2FACM+14th+International+Symposium+on+Distributed+Simulation+and+Real+Time+Applications&rft.atitle=Supporting+Multi-dimensional+Range+Query+in+HD+Tree&rft.au=Yunfeng+Gu&rft.au=Boukerche%2C+A&rft.au=Xun+Ye&rft.au=Araujo%2C+R+B&rft.date=2010-10-01&rft.pub=IEEE&rft.isbn=9781424486519&rft.issn=1550-6525&rft.spage=71&rft.epage=78&rft_id=info:doi/10.1109%2FDS-RT.2010.17&rft.externalDocID=5636710
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1550-6525&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1550-6525&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1550-6525&client=summon