Skip List Data Structure Based New Searching Algorithm and Its Applications: Priority Search

Our new algorithm, priority search, was created with the help of skip list data structure and algorithms. Skip list data structure consists of linked lists formed in layers, which were linked in a pyramidal way. The time complexity of searching algorithm is equal to O(lgN) in an N-element skip list data structure. The new developed searching algorithm was based on the hit search number for each searched data. If a datum has greater hit search number, then it was upgraded in the skip list data structure to the upper level. That is, the mostly searched data were located in the upper levels of the skip list data structure and rarely searched data were located in the lower levels of the skip list data structure. The pyramidal structure of data was constructed by using the hit search numbers, in another word, frequency of each data. Thus, the time complexity of searching was almost ?(1) for N records data set. In this paper, the applications of searching algorithms like linear search, binary search, and priority search were realized, and the obtained results were compared. The results demonstrated that priority search algorithm was better than the binary search algorithm.

@article{Aksu2016,
  title     = {Skip List Data Structure Based New Searching Algorithm and Its Applications: Priority Search},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {7},
  number    = {2},
  year      = {2016},
  publisher = {The Science and Information Organization},
  author    = {Mustafa Aksu and Ali Karci},
  doi       = {10.14569/IJACSA.2016.070220},
  url       = {https://doi.org/10.14569/IJACSA.2016.070220}
}