Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings.
Elad VerbinWei YuPublished in: CPM (2013)
Keyphrases
- random access
- data structure
- suffix array
- lower bound
- random accesses
- external memory
- compressed text
- upper bound
- suffix tree
- space efficient
- approximate string matching
- disk storage
- finite state automata
- main memory
- memory size
- np hard
- wavelet tree
- multiview video coding
- string matching
- solid state
- context free grammars
- flash memory
- quadtree
- inverted index
- optimal solution
- data compression
- b tree
- query processing
- hard disk
- variable length
- r tree
- pattern matching