Simple and Efficient Fully-Functional Succinct Trees
Joshimar Cordova, Gonzalo Navarro

TL;DR
This paper introduces a simplified, practical variant of a succinct tree data structure that achieves faster worst-case operation times and outperforms existing implementations in experiments.
Contribution
A new, simpler variant of the fully-functional succinct tree with worst-case $O( ext{log log } n)$ operation time, improving practicality and performance.
Findings
Experimental results show superior performance over existing implementations.
The new variant is easier to implement while maintaining efficient operation times.
Achieves worst-case $O( ext{log log } n)$ time complexity for tree operations.
Abstract
The fully-functional succinct tree representation of Navarro and Sadakane (ACM Transactions on Algorithms, 2014) supports a large number of operations in constant time using bits. However, the full idea is hard to implement. Only a simplified version with operation time has been implemented and shown to be practical and competitive. We describe a new variant of the original idea that is much simpler to implement and has worst-case time for the operations. An implementation based on this version is experimentally shown to be superior to existing implementations.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · semigroups and automata theory · Machine Learning and Algorithms
