Article Per Year (5 Year)
p-Index From 2021 - 2026
0.408
P-Index
This Author published in this journals
All Journal Infomans: Jurnal Ilmu-ilmu Informatika dan Manajemen
Firdaus, Isad
Unknown Affiliation
Computer Science & IT

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

 1 
Optimalisasi Algoritma Linear Search Berdasarkan Pola Akses Pengguna Dan Komparasi Metode Implementasi Didin, Jajang; Azzahra, Nabilla; Firdaus, Isad
Infoman's : Jurnal Ilmu-ilmu Informatika dan Manajemen Vol. 19 No. 2 (2025): Infoman's
Publisher : LPPM & Fakultas Teknologi Informasi UNSAP

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Data search efficiency is a crucial aspect of information system performance, particularly in applications handling dynamic data volumes within the public and private sectors. This study aims to analyze optimization strategies for the Linear Search algorithm through a user access pattern approach and to compare the technical performance between iterative and recursive implementation methods. The research methodology employs a quantitative approach involves computational experiments on datasets ranging from 1 million to 100 million records, alongside qualitative case studies on various existing information systems such as libraries, retail, and civil registry services. Test results indicate that despite sharing the same asymptotic time complexity, the iterative method proves to be far superior to the recursive method, demonstrating a significant execution time difference (0.0133 seconds versus 28.38 seconds on 100 million records) and more efficient memory usage. Furthermore, this study finds that the effectiveness of Linear Search can be drastically improved through the application of access pattern-based heuristic strategies, such as Move-to-Front for popular data and Timestamp Ordering for chronological data. The conclusion of this research recommends the use of the iterative Linear Search method combined with adaptive data position management as the optimal solution for systems characterized by dynamic and unordered data.
Analisis Perbandingan Performa Algoritma Sequential Search, Binary Search, dan SQL Search pada Aplikasi Kamus Digital Bahasa Indonesia Fadhilah, Naufal; Firdaus, Isad; Raihan Rasyiq, Rakan
Infoman's : Jurnal Ilmu-ilmu Informatika dan Manajemen Vol. 19 No. 2 (2025): Infoman's
Publisher : LPPM & Fakultas Teknologi Informasi UNSAP

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Scientific language is often difficult for the general public to understand, while the process of searching for meanings in conventional dictionaries is time-consuming. This issue triggers the need for digital dictionary applications equipped with fast and efficient search algorithms. This study aims to conduct a comparative performance analysis between Sequential Search, Binary Search, and SQL Search methods in an Indonesian digital dictionary application. The research method used is performance analysis by measuring two main parameters: search time speed and memory usage. Testing was conducted with word search scenarios at the beginning, middle, and end positions of the data. The results show that the Binary Search algorithm is the fastest method with an average time of 0.0405 seconds, followed by SQL Search, while Sequential Search is the slowest with an average time of 17.3785 seconds. In terms of resource efficiency, Sequential Search has the lowest memory usage due to its structural simplicity, but Binary Search remains superior in efficiency for processing large data. The conclusion of this study is that Binary Search is most effectively applied to applications with large sorted datasets, while SQL Search provides better flexibility because its data management is handled directly by the database system.Bibar
Co-Authors Azzahra, Nabilla Didin, Jajang Fadhilah, Naufal Raihan Rasyiq, Rakan