Deterministic 1–2 skip list in distributed system
Subhrangsu Mandal, Sandip Chakraborty, Sushanta Karmakar · 2012
Searching data efficiently in distributed applications like peer-to-peer system is a challenging task due to the random distribution of data among several participating nodes. Efficient data structures are designed and implemented to reduce the complexity of data searching in such an environment. In this paper a data structure called deterministic 1-2 skip list has been proposed as a solution for search problems in distributed environment. The data structure has three main operations viz. search, insert, and delete. The detailed description of the insertion, deletion and search operations are given in this paper. It is found that the message complexity of the insertion, deletion and search algorithm is O(log n) where n is the total number of nodes in the skip-list.