Data structures and network algorithms
Data structures and network algorithms
Self-adjusting binary search trees
Journal of the ACM (JACM)
The cell probe complexity of dynamic data structures
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Representing dynamic binary trees succinctly
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Succinct Representation of Balanced Parentheses and Static Trees
SIAM Journal on Computing
Representing Trees of Higher Degree
Algorithmica
Succinct ordinal trees with level-ancestor queries
ACM Transactions on Algorithms (TALG)
A simple optimal representation for balanced parentheses
Theoretical Computer Science
Compressed indexes for dynamic text collections
ACM Transactions on Algorithms (TALG)
Querying and maintaining a compact XML storage
Proceedings of the 16th international conference on World Wide Web
A unified access bound on comparison-based dynamic dictionaries
Theoretical Computer Science
XMark: a benchmark for XML data management
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Space-efficient static trees and graphs
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Succinct dynamic dictionaries and trees
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Fully-functional succinct trees
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Succinct representation of dynamic trees
Theoretical Computer Science
Engineering the LOUDS succinct tree representation
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
| Hi-index | 0.00 |
We consider succinct, or space-efficient, representations of ordinal trees. Representations exist that take 2n+o(n) bits to represent a staticn-node ordinal tree --- close to the information-theoretic minimum --- and support navigational operations in O(1) time on a RAM model; and some implementations have good practical performance. The situation is different for dynamic ordinal trees. Although there is theoretical work on succinct dynamic ordinal trees, there is little work on the practical performance of these data structures. Motivated by applications to representing XML documents, in this paper, we report on a preliminary study on dynamic succinct data structures. Our implementation is based on representing the tree structure as a sequence of balanced parentheses, with navigation done using the min-max tree of Sadakane and Navarro (SODA '10). Our implementation shows promising performance for update and navigation, and our findings highlight two issues that we believe will be important to future implementations: the difference between the finger model of (say) Farzan and Munro (ICALP '09) and the parenthesis model of Sadakane and Navarro, and the choice of the balanced tree used to represent the min-max tree.