Modified Skip Graph for world wide range query searching using multidimensional indexing

A skip graph is a resilient application-layer routing structure that supports range queries of distributed multidimensional data. By sorting deterministic keys into groups based on locally computed random membership vectors, nodes in a standard skip graph can optimize range query performance in distributed networks. We propose a modified skip graph, skip graph with superimposed kd index tree for multidimensional dimensional data and sorting within groups is based on locally computed random keys Compared to the state-of-the-art indexing schemes, m-ary substantially saves the index maintenance overhead, achieves a more balanced load distribution, and improves the range query performance in both cost and response latency in different environments like distributed networks, cloud networks and social networks etc.