Abstract
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(nlogw) 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(logw) inter-register operations. Our data structure can also be used to solve the weak prefix search problem, the index size of O(nlogw) bits is known to be optimal for any such data structure.The technical contributions include highly efficient single word indices, with out-degree w/logw (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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
