Comparison Between the Route Using Improved Detours and Shortest Route on Distributed Key-Value Store Based on Order Preserving Linear Hashing and Skip Graph

In this paper, improved detours of the route for the distributed key-value store based on order preserving linear hashing and Skip Graph are proposed. In this system, data are divided by order preserving linear hashing and Skip Graph is used for overlay network. Because of uniformity of the routing table of this system, short detours of the route can exist and can be calculated at the start node. By using these detours, the number of hops for the query forwarding is reduced. In this paper, the proposed improved detour is compared with the shortest route by experiments.