An implicit data structure supporting insertion, deletion, and search in O(log:OS2:OEn) time
Journal of Computer and System Sciences
The cell probe complexity of dynamic data structures
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Surpassing the information theoretic bound with fusion trees
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Representing dynamic binary trees succinctly
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Journal of Algorithms
Succinct indexable dictionaries with applications to encoding k-ary trees and multisets
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Succinct Representation of Balanced Parentheses and Static Trees
SIAM Journal on Computing
Succinct Dynamic Data Structures
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
Succinct ordinal trees with level-ancestor queries
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The level ancestor problem simplified
Theoretical Computer Science - Latin American theorotical informatics
Orderly Spanning Trees with Applications
SIAM Journal on Computing
Structuring labeled trees for optimal succinctness, and beyond
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Representing Trees of Higher Degree
Algorithmica
Time-space trade-offs for predecessor search
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Compressed indexes for dynamic text collections
ACM Transactions on Algorithms (TALG)
Ultra-succinct representation of ordered trees
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Succinct indexes for strings, binary relations and multi-labeled trees
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Compressed Suffix Trees with Full Functionality
Theory of Computing Systems
Balanced parentheses strike back
ACM Transactions on Algorithms (TALG)
Dynamic entropy-compressed sequences and full-text indexes
ACM Transactions on Algorithms (TALG)
Space-efficient static trees and graphs
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
An Improved Succinct Representation for Dynamic k-ary Trees
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
A Uniform Approach Towards Succinct Representation of Trees
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Succinct dynamic dictionaries and trees
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On the size of succinct indices
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Engineering the LOUDS succinct tree representation
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Optimal succinctness for range minimum queries
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Succinct ordinal trees based on tree covering
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
A new succinct representation of RMQ-information and improvements in the enhanced suffix array
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Data structures: time, I/Os, entropy, joules!
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Compressed self-indices supporting conjunctive queries on document collections
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Succinct representations of dynamic strings
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Note: Combined data structure for previous- and next-smaller-values
Theoretical Computer Science
Succinct representation of dynamic trees
Theoretical Computer Science
Space-efficient construction of Lempel-Ziv compressed text indexes
Information and Computation
ACM Transactions on Algorithms (TALG)
LRM-trees: compressed indices, adaptive sorting, and compressed permutations
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Summarized trace indexing and querying for scalable back-in-time debugging
Proceedings of the 25th European conference on Object-oriented programming
Alphabet-independent compressed text indexing
ESA'11 Proceedings of the 19th European conference on Algorithms
Improved compressed indexes for full-text document retrieval
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
Semi-indexing semi-structured data in tiny space
Proceedings of the 20th ACM international conference on Information and knowledge management
Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
SIAM Journal on Computing
Ultra-succinct representation of ordered trees with applications
Journal of Computer and System Sciences
Optimal succinctness for range minimum queries
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Practical compressed suffix trees
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Random access to grammar-compressed strings
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
New algorithms on wavelet trees and applications to information retrieval
Theoretical Computer Science
Succinct representations of permutations and functions
Theoretical Computer Science
Succinct ordinal trees based on tree covering
ACM Transactions on Algorithms (TALG)
CRAM: compressed random access memory
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Self-Indexed Grammar-Based Compression
Fundamenta Informaticae
Dynamizing succinct tree representations
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Linear-Space data structures for range minority query in arrays
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
LRM-Trees: Compressed indices, adaptive sorting, and compressed permutations
Theoretical Computer Science
Succinct data structures for path queries
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Improved compressed indexes for full-text document retrieval
Journal of Discrete Algorithms
ESP-index: A compressed index based on edit-sensitive parsing
Journal of Discrete Algorithms
Colored range queries and document retrieval
Theoretical Computer Science
Faster and smaller inverted indices with treaps
Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval
Space-efficient data structures for Top-k completion
Proceedings of the 22nd international conference on World Wide Web
Dynamic compressed strings with random access
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Compressed persistent index for efficient rank/select queries
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
XML tree structure compression using RePair
Information Systems
Spaces, Trees, and Colors: The algorithmic landscape of document retrieval on sequences
ACM Computing Surveys (CSUR)
Compact representation of Web graphs with extended functionality
Information Systems
On compressing permutations and adaptive sorting
Theoretical Computer Science
On the compression of search trees
Information Processing and Management: an International Journal
Hi-index | 0.01 |
We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a large number of operations on the tree can be supported in constant time under the word-RAM model. However existing data structures are not satisfactory in both theory and practice because (1) the lower-order term is Ω(n log log n/ log n), which cannot be neglected in practice, (2) the hidden constant is also large, (3) the data structures are complicated and difficult to implement, and (4) the techniques do not extend to dynamic trees supporting insertions and deletions of nodes. We propose a simple and flexible data structure, called the range min-max tree, that reduces the large number of relevant tree operations considered in the literature to a few primitives, which are carried out in constant time on sufficiently small trees. The result is then extended to trees of arbitrary size, achieving 2n + O(n/polylog(n)) bits of space. The redundancy is significantly lower than in any previous proposal, and the data structure is easily implemented. Furthermore, using the same framework, we derive the first fully-functional dynamic succinct trees.