Loading...

SkipTree: A Scalable range-queryable distributed data structure for multidimensional data

Alaei, S ; Sharif University of Technology | 2005

227 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/11602613_31
  3. Publisher: 2005
  4. Abstract:
  5. This paper presents the SkipTree, a new balanced, distributed data structure for storing data with multidimensional keys in a peer-to-peer network. The SkipTree supports range queries as well as single point queries which are routed in O(log n) hops. SkipTree is fully decentralized with each node being connected to O(logn) other nodes. The memory usage for maintaining the links at each node is O(log n log log n) on average and O(log2 n) in the worst case. Load balance is also guaranteed to be within a constant factor. © Springer-Verlag Berlin Heidelberg 2005
  6. Keywords:
  7. Data storage equipment ; Decentralized control ; Distributed computer systems ; Distributed database systems ; Storage allocation (computer) ; Telecommunication links ; Trees (mathematics) ; Constant factor ; Multidimensional data ; Nodes ; Peer-to-peer network ; Data structures
  8. Source: 16th International Symposium on Algorithms and Computation, ISAAC 2005, Hainan, 19 December 2005 through 21 December 2005 ; Volume 3827 LNCS , 2005 , Pages 298-307 ; 03029743 (ISSN); 3540309357 (ISBN); 9783540309352 (ISBN)
  9. URL: https://link.springer.com/chapter/10.1007/11602613_31