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.
Mendeley saves you time finding and organizing research
Choose a citation style from the tabs below