Minimal indices for predecessor search

Sarel Cohen*, Amos Fiat, Moshik Hershcovitch, Haim Kaplan

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


We give a new predecessor data structure which improves upon the index size of the Pətraşcu-Thorup data structures, reducing the index size from O(nw4/5) bits to O(n log w) bits, with optimal probe complexity. Alternatively, our new data structure can be viewed as matching the space complexity of the (probe-suboptimal) z-fast trie of Belazzougui et al. Thus, we get the best of both approaches with respect to both probe count and index size. The penalty we pay is an extra O(log w) inter-register operations. Our data structure can also be used to solve the weak prefix search problem, the index size of O(n log w) bits is known to be optimal for any such data structure. The technical contributions include highly efficient single word indices, with out-degree w/log w (compared to w1/5 of a fusion tree node). To construct these indices we device highly efficient bit selectors which, we believe, are of independent interest.

Original languageEnglish
Pages (from-to)12-30
Number of pages19
JournalInformation and Computation
StatePublished - Feb 2015


FundersFunder number
Israel Science Foundation822-10
Israeli Centers for Research Excellence4/11


    • Cell probe model
    • Fusion trees
    • Predecessor search
    • Successor search
    • Succinct data structures
    • Tries
    • Word RAM model


    Dive into the research topics of 'Minimal indices for predecessor search'. Together they form a unique fingerprint.

    Cite this