SkipTree: A Scalable Range-Queryable Distributed Data Structure for Multidimensional Data

This paper presents the SkipTree, a new balanced, distributed data structure for storing data with multidimensional keys in a peer-topeer 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(log n) 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.

• Type: Conference
• Year: 2005
• Where: ISAAC
• Authors: Saeed Alaei, Mohammad Toossi, Mohammad Ghodsi
• Keywords: ISAAC 2005, Multidimensional Keys, Single Point Queries, SkipTree Supports Range