An Efficient Range Search Method Utilizing Detour Routes in Skip Graph

Skip Graph is a structured overlay that preserves the order of keys and provides efficient routing, especially for complex queries such as range queries. However, existing routing methods for range queries in Skip Graph have problems such as long path lengths and a large number of messages because of inefficiencies. In this paper, we propose a new routing method for range queries named Detouring Range Search (DRS), that provides more efficient routing by utilizing detour routes. In the proposed method, each node that receives a query divides the target range into subranges based on the center of the subordinate node sequence and delegates them to its neighbor nodes. Our evaluation experiments show that the proposed method can reduce the average path length by approximately 20% compared with that of an existing method when the number of nodes is sufficiently large.