BIROn - Birkbeck Institutional Research Online

    Adaptive search over sorted sets

    Bonasera, B. and Ferrara, E. and Fiumara, G. and Pagano, F. and Provetti, Alessandro (2015) Adaptive search over sorted sets. Journal of Discrete Algorithms 30 , pp. 128-133. ISSN 1570-8667.

    [img] Text
    bonasera-adaptive_search-JDA15.pdf - Published Version of Record
    Restricted to Repository staff only

    Download (215kB)


    We revisit the classical algorithms for searching over sorted sets to introduce an algorithm refinement, called Adaptive search, that combines the good features of Interpolation search and those of Binary search. W.r.t. Interpolation search, only a constant number of extra comparisons is introduced. Yet, under diverse input data distributions our algorithm shows costs comparable to that of Interpolation search, i.e., O(log logn) while the worst-case cost is always in O(logn), as with Binary search. On benchmarks drawn from large datasets, both synthetic and real-life, Adaptive search scores better times and lesser memory accesses even than Santoro and Sidney’s Interpolation–Binary search.


    Item Type: Article
    School: Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
    Research Centres and Institutes: Data Analytics, Birkbeck Institute for
    Depositing User: Alessandro Provetti
    Date Deposited: 12 Oct 2018 13:27
    Last Modified: 09 Aug 2023 12:45


    Activity Overview
    6 month trend
    6 month trend

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item