Analisis Performa Waktu Eksekusi dan Penggunaan Memori Algoritma Linear Search dan Binary Search pada Sistem Pencarian Buku Perpustakaan Digital
- Husnul Amisyah Universitas Muhammadiyah Bengkulu, Bengkulu, Indonesia
-
Agung Kharisma Hidayah
*
Universitas Muhammadiyah Bengkulu, Bengkulu,
Indonesia
(*) Corresponding Author
Abstract
The growth of digital libraries has increased the need for book search systems capable of providing fast and efficient retrieval as the amount of stored data continues to grow. Although Linear Search and Binary Search algorithms have been widely applied in search processes, their implementation and performance evaluation in web-based digital library systems still require analysis under practical implementation conditions. This study aims to analyze and compare the performance of both algorithms based on execution time and memory usage in a digital library book search system. An experimental method was employed by implementing Linear Search and Binary Search using PHP and MySQL. Performance testing was conducted on datasets containing 10, 50, 100, 500, and 1000 book records under the same testing environment. The results indicate that Binary Search achieved lower execution times for most dataset sizes; however, its execution time was slightly higher than Linear Search when tested with 1000 records. The average memory usage of Linear Search was 0.000048 MB, while Binary Search averaged 0.000043 MB, although Binary Search consumed more memory on the 500- and 1000-record datasets. These findings demonstrate that algorithm performance is influenced not only by theoretical complexity but also by system implementation, data characteristics, and the testing environment. Therefore, selecting a search algorithm should consider the implementation context and system requirements to achieve optimal performance.
Downloads
References
Y. Reswan, Y. Darnita, A. R. W. M. Mahfuzhi, and E. Elviani, “Implementation Of Sequential Searching Algorithm In Car Sales E-Commerce Web,” J. Komputer, Inf. dan Teknol., vol. 4, no. 1, pp. 1–14, 2024, doi: 10.53697/jkomitek.v4i1.1807.
F. Hao, J. Daugman, and P. Zieliński, “A fast search algorithm for a large fuzzy database,” IEEE Trans. Inf. Forensics Secur., vol. 3, no. 2, pp. 203–212, 2008, doi: 10.1109/TIFS.2008.920726.
S. Xavier P, J. V A, and B. M, “How to Select a Searching Algorithm-A Comparative Study,” Int. J. Comput. Trends Technol., vol. 48, no. 3, pp. 108–111, 2017, doi: 10.14445/22312803/ijctt-v48p122.
A. R. Chadha, R. Misal, and T. Mokashi, “Modified Binary Search Algorithm,” Int. J. Appl. Inf. Syst., vol. 7, no. 2, pp. 2089–2100, 2014.
A. Deligkas, G. B. Mertzios, and P. G. Spirakis, “Binary Search in Graphs Revisited,” Algorithmica, vol. 81, no. 5, pp. 1757–1780, 2019, doi: 10.1007/s00453-018-0501-y.
Y. Disser and S. Kratsch, “Robust and adaptive search,” Leibniz Int. Proc. Informatics, LIPIcs, vol. 66, no. 26, pp. 1–14, 2017, doi: 10.4230/LIPIcs.STACS.2017.26.
W. S. Wahyuni, S. Andryana, and B. Rahman, “Penggunaan Algoritma Sequential Searching Pada Aplikasi Perpustakaan Berbasis Web,” JIPI (Jurnal Ilm. Penelit. dan Pembelajaran Inform., vol. 7, no. 2, pp. 294–302, 2022, doi: 10.29100/jipi.v7i2.2646.
S. Salakos and N. Ploskas, “Analysis and Comparison of Binary and Interpolation Search Algorithms in a B-tree,” ACM Int. Conf. Proceeding Ser., pp. 74–78, 2021, doi: 10.1145/3503823.3503837.
T. K. Wulandari, “Penerapan Metode Binary Search dan Hamming Distance untuk E-library SMAN 2 Katingan Hilir,” KONSTELASI Konvergensi Teknol. dan Sist. Inf., vol. 2, no. 1, pp. 33–42, 2022, doi: 10.24002/konstelasi.v2i1.5623.
R. Toyib, Y. Darnita, and A. R. S. Deva, “Penerapan Algoritma Binary Search Pada Aplikasi E-Order,” J. Media Infotama, vol. 17, no. 1, pp. 30–37, 2021, doi: 10.37676/jmi.v17i1.1314.
D. Markuci and C. Prianto, “Analisis Perbandingan Penggunaan Algoritma Sequential Search Dan Binary Search Pada Aplikasi Surat Perjalanan Dinas,” JATI (Jurnal Mhs. Tek. Inform., vol. 6, no. 1, pp. 110–119, 2022, doi: 10.36040/jati.v6i1.4569.
B. J. D. Sitompul, A. Yusupa, and N. J. Tuturoong, “Implementasi Algoritma Binary Search Pada Pencarian Data Jemaat Gereja Hkbp Manado,” J. Inform. Polinema, vol. 9, no. 1, pp. 17–24, 2022, doi: 10.33795/jip.v9i1.1123.
Agung Kharisma, “Aplikasi Kamus Bahasa Indonesia - Rejang Menggunakan Metode Sequential Searching Berbasis Android,” J. Process., vol. 17, no. 1, pp. 58–65, 2022, doi: 10.33998/processor.2022.17.1.1171.
A. S. Mohammed, Ş. E. Amrahov, and F. V. Çelebi, “Interpolated binary search: An efficient hybrid search algorithm on ordered datasets,” Eng. Sci. Technol. an Int. J., vol. 24, no. 5, pp. 1072–1079, 2021, doi: 10.1016/j.jestch.2021.02.009.
V. P.Parmar and C. Kumbharana, “Comparing Linear Search and Binary Search Algorithms to Search an Element from a Linear List Implemented through Static Array, Dynamic Array and Linked List,” Int. J. Comput. Appl., vol. 121, no. 3, pp. 13–17, 2015, doi: 10.5120/21519-4495.
W. Istiono, “Speed Analysis of Binary Search and Interpolation Search for Searching Identification Numbers on National Identity Cards,” Asian J. Res. Comput. Sci., vol. 15, no. 4, pp. 34–41, 2023, doi: 10.9734/ajrcos/2023/v15i4328.
A. Lin, “Binary search algorithm,” WikiJournal Sci., vol. 2, no. 1, pp. 1–13, 2019, doi: 10.15347/wjs/2019.005.
S. Orhani, “Binary search algorithm for natural number targets,” J. Basic Sci. Technol. J. homepage, vol. 11, no. 3, pp. 88–92, 2022.
D. Amato, G. Lo Bosco, and R. Giancarlo, “Standard versus uniform binary search and their variants in learned static indexing: The case of the searching on sorted data benchmarking software platform,” Softw. - Pract. Exp., vol. 53, no. 2, pp. 318–346, 2023, doi: 10.1002/spe.3150.
Kunal, Tushar, and G. Chakraborty, “Decomposed Algorithm for Reducing Time Complexity in Binary Search,” Int. J. Eng. Res. Technol., vol. 10, no. 04, pp. 117–121, 2021.
V. Singh et al., “Bayesian Binary Search,” Algorithms, vol. 18, no. 8, pp. 1–27, 2025, doi: 10.3390/a18080452.
P. Chalermsook, J. Chuzhoy, and T. Saranurak, “Pinning Down the Strong Wilber-1 Bound for Binary Search Trees,” Theory Comput., vol. 19, no. 8, pp. 1–71, 2023, doi: 10.4086/toc.2023.v019a008.
M. N. Saeed et al., “Empirical Analysis of Quaternary and Binary Search,” J. Comput. Biomed. Informatics, vol. 2024, no. Special Issue (ICASET), pp. 1–6, 2024.
Bila bermanfaat silahkan share artikel ini
Berikan Komentar Anda terhadap artikel Analisis Performa Waktu Eksekusi dan Penggunaan Memori Algoritma Linear Search dan Binary Search pada Sistem Pencarian Buku Perpustakaan Digital
Pages: 1257-1266
Copyright (c) 2026 Husnul Amisyah, Agung Kharisma Hidayah
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under Creative Commons Attribution 4.0 International License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (Refer to The Effect of Open Access).
