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

Abstract

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.

Authors and Affiliations

Mustafa Aksu, Ali Karci

Keywords

Related Articles

SIP Signaling Implementations and Performance Enhancement over MANET: A Survey

The implementation of the Session Initiation Protocol (SIP)-based Voice over Internet Protocol (VoIP) and multimedia over MANET is still a challenging issue. Many routing factors affect the performance of SIP signaling a...

Synchronous Authentication Key Management Scheme for Inter-eNB Handover over LTE Networks

Handover process execution without active session termination is considered one of the most important attribute in the Long Term Evolution (LTE) networks. Unfortunately, this service always is suffered from the growing o...

Image Edge Detection based on ACO-PSO Algorithm

This survey focuses on the problem of parameters selection in image edge detection by ant colony optimization (ACO) algorithm. By introducing particle swarm optimization (PSO) algorithm to optimize parameters in ACO algo...

Impact of Android Phone Rooting on User Data Integrity in Mobile Forensics

Modern cellular phones are potent computing de-vices, and their capabilities are constantly progressing. The Android operating system (OS) is widely used, and the number of accessible apps for Android OS phones is unprec...

Wavelet Based Change Detection for Four Dimensional Assimilation Data in Space and Time Domains

Method for time change detection of four dimensional assimilation data by means of wavelet analysis is proposed together with spatial change detection with satellite imagery data. The method is validated with assimilatio...

Download PDF file
  • EP ID EP112233
  • DOI 10.14569/IJACSA.2016.070220
  • Views 120
  • Downloads 0

How To Cite

Mustafa Aksu, Ali Karci (2016). Skip List Data Structure Based New Searching Algorithm and Its Applications: Priority Search. International Journal of Advanced Computer Science & Applications, 7(2), 149-154. https://europub.co.uk/articles/-A-112233