Usage of Kd-Tree in DHT-Based Indexing Scheme

@article{Mar2013UsageOK,
  title={Usage of Kd-Tree in DHT-Based Indexing Scheme},
  author={Yi Yi Mar and Aung Htein Maw and Khine Moe Nwe},
  journal={International Journal of Future Computer and Communication},
  year={2013},
  pages={456-460}
}
  • Y. MarA. MawK. Nwe
  • Published 2013
  • Computer Science
  • International Journal of Future Computer and Communication
Distributed Hash Table (DHT) is a promising approach for a distributed data management platform in a large-scale network environment. In order to provide an efficient query processing and resource sharing in information discovery services, any DHT-based P2P system essent ially needs to build an efficient indexing scheme for supporting users’ desired queries (complex query, i.e., multi-dimensi onal and/or range query). In this paper, multi-dimensional indexing scheme is built by generating multi… 

Figures and Tables from this paper

References

SHOWING 1-10 OF 23 REFERENCES

m-LIGHT: Indexing Multi-Dimensional Data over DHTs

Compared to the state-of-the-art indexing schemes, m- LIGHT substantially saves the index maintenance overhead, achieves a more balanced load distribution, and improves the range query performance in both bandwidth consumption and response latency.

DHR-Trees : A Distributed Multidimensional Indexing Structure for P2P Systems(次世代ネットワーク,SIP・プレゼンス,一般)

DHR-trees enables multidimensional range query to be executed similarly as in overlapping regions tree in P2P systems and makes it fault-tolerant and scalable to dynamic network environment with a large number of peers as well.

DHR-Trees: A Distributed Multidimensional Indexing Structure for P2P Systems

  • Xinfa WeiK. Sezaki
  • Computer Science
    2006 Fifth International Symposium on Parallel and Distributed Computing
  • 2006
DHR-trees enables multidimensional range query to be executed similarly as in overlapping regions tree in P2P systems and makes it fault-tolerant and scalable to dynamic network environment with a large number of peers as well.

Distributed Arbitrary Segment Trees: Providing Efficient Range Query Support over Public DHT Services

  • Xinuo ChenS. Jarvis
  • Computer Science
    2007 IEEE 18th International Symposium on Personal, Indoor and Mobile Radio Communications
  • 2007
This paper defines a Distributed Arbitrary Segment Tree (DAST) and introduces the concept of accuracy of results (AoR) for range queries, and demonstrates that by adjusting AoR, the DHT operational overhead can be improved.

Distributed Segment Tree: Support of Range Query and Cover Query over DHT

Range query, which is defined as to find all the keys in a certain range over the underlying P2P network, has received a lot of research attentions recently. However, cover query, which is to find

A distributed quadtree index for peer-to-peer settings

A distributed quadtree index for enabling more powerful access on complex data over P2P networks based on the Chord method that can seamlessly execute a single query on multiple branches of the index hosted by a dynamic set of peers.

Prefix Hash Tree An Indexing Data Structure over Distributed Hash Tables

The design and implementation of a Prefix Hash Tree a distributed data structure that enables more sophisticated queries over a DHT that is both efficient and resilient.

A novel load balancing mechanism for P2P networking

It is proved that the load balancing algorithm is robust and scalable, achieving an O(log2N) complexity, where N is the number of peers, and illustrated how the algorithm can be used to build a scalable Grid Information Service supporting multi-attribute and range queries on available services within the shared Grid infrastructure.

Chord: A scalable peer-to-peer lookup service for internet applications

Results from theoretical analysis, simulations, and experiments show that Chord is scalable, with communication cost and the state maintained by each node scaling logarithmically with the number of Chord nodes.

Chord: a scalable peer-to-peer lookup protocol for internet applications

Results from theoretical analysis and simulations show that Chord is scalable: Communication cost and the state maintained by each node scale logarithmically with the number of Chord nodes.