Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings
Shiteng ChenElad VerbinWei YuPublished in: CoRR (2012)
Keyphrases
- data structure
- random access
- random accesses
- suffix array
- lower bound
- external memory
- main memory
- compressed text
- suffix tree
- upper bound
- finite state automata
- approximate string matching
- disk storage
- wavelet tree
- space efficient
- solid state
- edit distance
- memory size
- multiview video coding
- string matching
- data compression
- np hard
- quadtree
- index structure
- flash memory
- hard disk
- b tree
- tree structure
- objective function
- inverted index
- multiresolution