Interpolated binary search: An efficient hybrid search algorithm on ordered datasets

Basit Öğe Kaydı
dc.authoridMohammed, Adnan Saher/0000-0002-4539-2867
dc.authoridEmrah Amrahov, Sahin/0000-0001-7747-5467
dc.contributor.authorMohammed, Adnan Saher
dc.contributor.authorAmrahov, Sahin Emrah
dc.contributor.authorCelebi, Fatih, V
dc.date.accessioned2024-09-29T15:57:35Z
dc.date.available2024-09-29T15:57:35Z
dc.date.issued2021
dc.departmentKarabük Üniversitesien_US
dc.description.abstractThe exponential increase in the rate of data size is much higher than the increase in the speed of the computer, which has given much focus to search algorithms in the research literature. Finding an item in an ordered dataset is an efficient method in the data processing. However, binary and interpolation algorithms are commonly used to search ordered datasets in many applications. In this paper, we propose a hybrid algorithm for searching ordered datasets based on the idea of interpolation and binary search. The proposed algorithm is called Interpolated Binary Search (IBS). It is well known that the performance of traditional interpolation search depends specifically on key distribution, and its performance degrades significantly in non-uniform distributed datasets. Therefore, our proposed algorithm works efficiently on various distribution datasets. In particular, IBS aims to search datasets of unknown distribution or data sets that change dynamically and produce a dynamic distribution. Experimental results show that IBS performs better compared to other algorithms that use a similar approach. (C) 2021 Karabuk University. Publishing services by Elsevier B.V.en_US
dc.description.sponsorshipImam Ja'afar Al-sadiq University, Kirkuk, Iraqen_US
dc.description.sponsorshipThis research is partially supported by Imam Ja'afar Al-sadiq University, Kirkuk, Iraq.en_US
dc.identifier.doi10.1016/j.jestch.2021.02.009
dc.identifier.endpage1079en_US
dc.identifier.issn2215-0986
dc.identifier.issue5en_US
dc.identifier.scopus2-s2.0-85103277061en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.startpage1072en_US
dc.identifier.urihttps://doi.org/10.1016/j.jestch.2021.02.009
dc.identifier.urihttps://hdl.handle.net/20.500.14619/4905
dc.identifier.volume24en_US
dc.identifier.wosWOS:000672103600003en_US
dc.identifier.wosqualityQ1en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherElsevier - Division Reed Elsevier India Pvt Ltden_US
dc.relation.ispartofEngineering Science and Technology-An International Journal-Jestechen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectBinary searchen_US
dc.subjectInterpolation searchen_US
dc.subjectHybrid searchen_US
dc.subjectAdaptive searchen_US
dc.subjectInterpolation binary searchen_US
dc.titleInterpolated binary search: An efficient hybrid search algorithm on ordered datasetsen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu