Loading...

Skiptree: a new scalable distributed data structure on multidimensional data supporting range-queries

Alaei, S ; Sharif University of Technology

462 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.comcom.2009.08.001
  3. Abstract:
  4. This paper presents a new balanced, distributed data structure for storing data with multidimensional keys in a peer-to-peer network. It supports range queries as well as single point queries which are routed in O (log n) hops. Our structure, called SkipTree, is fully decentralized with each node being connected to O (log n) other nodes. We propose modifications to the structures, so that the memory usage for maintaining the link structure at each node is reduced from the worst case of O (n) to O (log n log log n) on the average and O (log2 n) in the worst case. It is also shown that the load balancing is guaranteed to be within a constant factor. Our experimental results verify our theoretical proofs
  5. Keywords:
  6. Distributed data structures ; Peer-to-peer networks ; Range query ; Skipnet ; Constant factors ; Link structure ; Load-balancing ; Memory usage ; Multidimensional data ; Single point ; Worst case ; Ad hoc networks ; Data structures ; Distributed computer systems
  7. Source: Computer Communications ; Volume 33, Issue 1 , 2010 , Pages 73-82 ; 01403664 (ISSN)
  8. URL: http://www.sciencedirect.com/science/article/pii/S0140366409002187