A Framework for Dynamizing Succinct Data Structures

Citation data:

Automata, Languages and Programming, Page: 521-532

Publication Year:
2007
Usage 764
Downloads 635
Abstract Views 129
Citations 7
Citation Indexes 7
Repository URL:
https://works.bepress.com/ankur_gupta/9; https://digitalcommons.butler.edu/facsch_papers/97
DOI:
10.1007/978-3-540-73420-8_46
Author(s):
Ankur Gupta; Wing-Kai Hon; Rahul Shah; Jeffrey Scott Vitter
Publisher(s):
Springer Nature
Tags:
succinct data structures; dynamic; framework; Computer Sciences; Theory and Algorithms
book chapter description
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.