Copyright Statement: This is an open access article licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, even commercially as long as the original work is properly cited.
Digital Object Identifier (DOI) : 10.14569/IJACSA.2017.080855
Article Published in International Journal of Advanced Computer Science and Applications(IJACSA), Volume 8 Issue 8, 2017.
Abstract: Information storage and retrieval is the fundamental requirement for many real-time applications. These systems demand that data should be sorted all the time, real-time insertion, deletion and searching should be supported and system must support dynamic entries. These systems require search operations to be performed from massive databases implemented by various data structures. The common data structures used by these systems are stack, queue or linked list all having their own limitations. The biggest advantage of using stack is that binary search can be performed on it easily while on the other hand insertion and deletion of nodes involves more processing overhead. In linked list, insertion and deletion of nodes is easier but searching operation involves more processing overhead as binary search cannot be performed efficiently on it. In this paper, a hybrid solution is presented for such systems, which provides efficient insertion, deletion and searching operations. Results show the effectiveness of the proposed approach as it outperforms the existing techniques used by these systems.
Syed Ali Hassan, Imran Ul Haq, Muhammad Asif, Maaz Bin Ahmad and Moeen Tayyab, “An Efficient Scheme for Real-time Information Storage and Retrieval Systems: A Hybrid Approach” International Journal of Advanced Computer Science and Applications(IJACSA), 8(8), 2017. http://dx.doi.org/10.14569/IJACSA.2017.080855