Abstract
We present a framework to dynamize succinct data structures, to encourage their use over non-succinct versions in a wide variety of important application areas. Our framework can dynamize most stateof-the-art succinct data structures for dictionaries, ordinal trees, labeled trees, and text collections.
| Original language | American English |
|---|---|
| DOIs | |
| State | Published - Jul 1 2007 |
Keywords
- dynamic
- framework
- succinct data structures
Disciplines
- Computer Sciences
- Theory and Algorithms
Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS