Implementing Range Queries with a Decentralized Balanced Tree over Distributed Hash Tables

  • Lopes N
  • Baquero C
  • 10


    Mendeley users who have this article in their library.
  • 7


    Citations of this article.


Range queries, retrieving all keys within a given range, is an important add-on for Distributed Hash Tables (DHTs), as theyrely only on exact key matching lookup. In this paper we support range queries through a balanced tree algorithm, DecentralizedBalanced Tree, that runs over any DHT system.Our algorithm is based on the B+ -tree  design that efficiently stores clustered data while maintaining a balanced load on hosts. The internal structure ofthe balanced tree is suited for range queries operations over many data distributions since it easily handles clustered datawithout losing performance.We analyzed, and evaluated our algorithm under a simulated environment, to show it’s operation scalability for both insertionsand queries. We will show that the system design imposes a fixed penalty over the DHT access cost, and thus inherits the scalabilityproperties of the chosen underlying DHT.

Author-supplied keywords

  • range queries over trees

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Nuno Lopes

  • Carlos Baquero

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free