Supporting Multi-dimensional Range Query in HD Tree

Gu, Yaxu; Boukerche, Azzedine; Ye, Xun; Araújo, Regina B.

doi:10.1109/ds-rt.2010.17

Cited by 4 publications

(11 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, the hierarchical structure has the non-comparable advantage of maintaining data locality preserved from multi-dimensional space partitioning. There are two direct observations described in [13] concerning recursive decomposition: (1) data localities extend exponentially as the recursive decomposition of data space goes deeper; and (2) data localities expand exponentially as the dimensionality of data space goes higher. Therefore, the system constraint for multi-dimensional range query can be stated as follows: how to accommodate and maintain data locality preserved from recursive decomposition among data ranges with an exponentially extending and expanding rate.…”

Section: Why Tree Structure?mentioning

confidence: 98%

“…In [13], a blind routing algorithm (BLINDDR) was described. This algorithm directs the routing request from the source to the destination at the same depth d via intermediate nodes at depth d and d−1 only; and, it shows that the worst case time complexity of distributed routing is 2d (O(lg(n))).…”

Section: Supporting Multi-dimensional Range Querymentioning

confidence: 99%

“…An HD Tree [13] is a cyclic graph built over a complete k-ary tree. The add-on distributed structure is constructed by making a limited number of extra connections.…”

Section: Hd Treementioning

confidence: 99%

“…In our previous work, we proposed a novel distributed data structure, the Hierarchically Distributed Tree (HD Tree) [13], to support multi-dimensional range query from the structured P2P overlay layer. The motivation of proposing this new data structure is stimulated by the observation that recursive decomposition has an inherent connection with a tree structure.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

HD Tree: A novel data structure to support multi-dimensional range query for P2P networks

Boukerche

2011

Journal of Parallel and Distributed Computing

Self Cite

View full text Add to dashboard Cite

Section: Why Tree Structure?mentioning

confidence: 98%

Section: Supporting Multi-dimensional Range Querymentioning

confidence: 99%

“…An HD Tree [13] is a cyclic graph built over a complete k-ary tree. The add-on distributed structure is constructed by making a limited number of extra connections.…”

Section: Hd Treementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

HD Tree: A novel data structure to support multi-dimensional range query for P2P networks

Boukerche

2011

Journal of Parallel and Distributed Computing

Self Cite

View full text Add to dashboard Cite

“…This approach could guarantee a well-balanced load, because the data space partitioning and node assignment is processed dynamically. Gu Y, Boukerche A, Ye X, et al [17] proposed a HD tree method aiming at solving the data locality to support range query in P2P systems. They use the space filling curve to partition the data space and the HD tree to organize the nodes within the P2P system to reduce routing costs.…”

Section: Range Query Methods In P2p Systemmentioning

confidence: 99%

A distributed range query framework for the internet of things

Zhang

Wang

2015

2015 18th International Conference on Intelligence in Next Generation Networks

View full text Add to dashboard Cite

A distributed range query framework for the Internet of Things Förnamn Efternamn Congcong ZhangA Distributed Range Query Framework for the Internet of Things Congcong Zhang 2014-11-15 i AbstractWith the rapid development of information technology, applications referring to the Internet of things are booming. Applications that gather information from sensors and affect the context environment with actuators can provide customized and intelligent behaviour to users. These applications have become widely used nowadays in daily life and have initiated the multi-dimensional range query demand referring to the Internet of things. As the data information is fully distributed and the devices like sensors, mobile phones, etc., has limited resources and finite energy, supporting efficient range query is a tough challenge. In this paper, we have proposed a distributed range query framework for Internet of things. In order to save energy costs and reduce the network traffic, we suggest a reporting data range mechanism in the sensing peers, which choose to report a data range and report again only when the peer senses an abnormal data instead of the common moving data method. In addition, we selected some strong peers to be used as the super peers to create a data index by collecting the reporting data range, which will be used for performing range queries. The study has shown that our proposal framework could reduce resource costs in the less strong peers like sensors and mobile phones, and reduce network traffic among all the peers within the network, as well as support a range query function. According the evaluation results, the reporting data range method could greatly reduce the data migration times and save energy costs, and the data index could significantly reduce accessing unnecessary peers and diminish the network traffic.

show abstract

Error-Resilient Routing for Supporting Multi-dimensional Range Query in HD Tree

Boukerche

2011

2011 IEEE/ACM 15th International Symposium on Distributed Simulation and Real Time Applications

Self Cite

View full text Add to dashboard Cite

The Hierarchically Distributed Tree (HD Tree) is a novel distributed data structure built over a complete tree. The purpose of proposing this new data structure is to better support multi-dimensional range query in the distributed environment. HD Tree doubles the number of neighbors at the cost of doubling total links of a tree. The routing operation in HD Tree is supposed to be highly error-resilient. In HD Tree, the routing table size is determined by the system parameter k, and the performance of all basic operations are bound by O(lg(n)). Multiple routing options can be found between any two nodes in the system. This paper explores fault tolerant routing strategies in HD Tree. The experimental results produce very limited and unnoticeable increases in routing cost when conducting range queries in an error-prone routing environment.The maximum failures we have tested are about 5 percent of routing nodes. The experimental results also indicate that higher fault tolerant capability requires finer consideration in the design of the error-resilient routing strategy.Index Terms-fault tolerance, error-resilient, distributed, data structure, HD Tree, peer-to-peer (P2P), overlay, associative searching, multi-dimensional, range query

show abstract

Supporting Multi-dimensional Range Query in HD Tree

Cited by 4 publications

References 21 publications

HD Tree: A novel data structure to support multi-dimensional range query for P2P networks

HD Tree: A novel data structure to support multi-dimensional range query for P2P networks

A distributed range query framework for the internet of things

Error-Resilient Routing for Supporting Multi-dimensional Range Query in HD Tree

Contact Info

Product

Resources

About