Dynamic compressed strings with random access

Authors:
Roberto Grossi;Rajeev Raman;Satti Srinivasa Rao;Rossano Venturini
Affiliations:
Dipartimento di Informatica, Università di Pisa, Italy;Department of Computer Science, University of Leicester, UK;School of Computer Science and Engineering, Seoul National Univerity, Korea;Dipartimento di Informatica, Università di Pisa, Italy
Venue:
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Year:
2013

Citing 20
Cited 0

The cell probe complexity of dynamic data structures

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Dynamic Perfect Hashing: Upper and Lower Bounds

SIAM Journal on Computing
An analysis of the Burrows—Wheeler transform

Journal of the ACM (JACM)
A New Trade-Off for Deterministic Dictionaries

SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Resizable Arrays in Optimal Time and Space

WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Succinct Dynamic Data Structures

WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Cuckoo hashing

Journal of Algorithms
Indexing compressed text

Journal of the ACM (JACM)
Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching

SIAM Journal on Computing
Squeezing succinct data structures into entropy bounds

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Logarithmic Lower Bounds in the Cell-Probe Model

SIAM Journal on Computing
Note: A simple storage scheme for strings achieving entropy bounds

Theoretical Computer Science
Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets

ACM Transactions on Algorithms (TALG)
Compressed Text Indexes with Fast Locate

CPM '07 Proceedings of the 18th annual symposium on Combinatorial Pattern Matching
Compressing and indexing labeled trees, with applications

Journal of the ACM (JACM)
Cell-probe lower bounds for succinct partial sums

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Fully-functional succinct trees

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Optimal trade-offs for succinct string indexes

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Succinct indexes for strings, binary relations and multilabeled trees

ACM Transactions on Algorithms (TALG)
CRAM: compressed random access memory

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of storing a string S in dynamic compressed form, while permitting operations directly on the compressed representation of S: access a substring of S; replace, insert or delete a symbol in S; count how many occurrences of a given symbol appear in any given prefix of S (called rank operation) and locate the position of the ith occurrence of a symbol inside S (called select operation). We discuss the time complexity of several combinations of these operations along with the entropy space bounds of the corresponding compressed indexes. In this way, we extend or improve the bounds of previous work by Ferragina and Venturini [TCS, 2007], Jansson et al. [ICALP, 2012], and Nekrich and Navarro [SODA, 2013].