SFB: a scalable method for handling range queries on Skip Graphs

摘要

Skip Graph is a promising candidate algorithm for large scale distributed systems. The principal feature is range query functionality, but Skip Graph does not have a definite method of multicasting inside ranges designated by query issuers. Even though several simple ways can be considered, they are inefficient regarding the latency or traffic volume. In this letter, we first introduce Multi-Range Forwarding (MRF) used in Multi-key Skip Graph. MRF can be used even in normal Skip Graph, and is efficient compared to the simple ways. Second, we propose a method named Split-Forward Broadcasting (SFB). We analytically evaluate SFB and explain that SFB can roughly halve the average number of hops of MRF.