Skip List Data Structure Based New Searching Algorithm and Its Applications: Priority Search
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2016, Vol 7, Issue 2
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
- EP ID EP112233
- DOI 10.14569/IJACSA.2016.070220
- Views 131
- Downloads 0
Improve Traffic Management in the Vehicular Ad Hoc Networks by Combining Ant Colony Algorithm and Fuzzy System
Over the last years, total number of transporter has increased. High traffic leads to serious problems and finding a sensible solution to solve the traffic problem is a significant challenge. Also, the use of the full ca...
Detecting Inter-Component Vulnerabilities in Event-based Systems
Event-based system (EBS) has become popular because of its high flexibility, scalability, and adaptability. These advantages are enabled by its communication mechanism—implicit invocation and implicit concurrency between...
Fault Attacks Resistant Architecture for KECCAK Hash Function
The KECCAK cryptographic algorithms widely used in embedded circuits to ensure a high level of security to any systems which require hashing as the integrity checking and random number generation. One of the most efficie...
Review of Community Detection over Social Media:Graph Prospective
Community over the social media is the group of globally distributed end users having similar attitude towards a particular topic or product. Community detection algorithm is used to identify the social atoms that are mo...
Reduced-Latency and Area-Efficient Architecture for FPGA-Based Stochastic LDPC Decoders
This paper introduces a new field programmable gate array (FPGA) based stochastic low-density parity-check (LDPC) decoding process, to implement fully parallel LDPC-decoders. The proposed technique is designed to optimiz...