Minimal indices for successor search (extended abstract)

Sarel Cohen, Amos Fiat, Moshik Hershcovitch, Haim Kaplan

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


We give a new successor data structure which improves upon the index size of the Pǎtraşcu-Thorup data structures, reducing the index size from O(n w4/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 the w1/5 out-degree of fusion tree based indices). To construct such high efficiency single word indices we device highly efficient bit selectors which, we believe, are of independent interest.

Original languageEnglish
Title of host publicationMathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Proceedings
Number of pages12
StatePublished - 2013
Event38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013 - Klosterneuburg, Austria
Duration: 26 Aug 201330 Aug 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8087 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013


  • Cell Probe Model
  • Fusion Trees
  • Predecessor Search
  • Succinct Data Structures
  • Tries
  • Word RAM model


Dive into the research topics of 'Minimal indices for successor search (extended abstract)'. Together they form a unique fingerprint.

Cite this