A framework for dynamizing succinct data structures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4596 LNCS, Issue , 2007, Pages 521-532

  Gupta, Ankur ^a   Hon, Wing Kai ^b   Shah, Rahul ^a   Vitter, Jeffrey Scott ^a  

^a Purdue University   (United States)

^b NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY; PROBLEM SOLVING; QUERY PROCESSING; TREES (MATHEMATICS); XML;

INDEXING STRUCTURES; QUERY BOUNDS; SUBPATH QUERIES; TEXT COLLECTIONS;

DATA STRUCTURES;

EID: 38149092499     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73420-8_46     Document Type: Conference Paper

References (16)

1. Benoit, D., Demaine, E., Munro, I., Raman, R., Raman, V., Rao, S.: Representing trees of higher degree. Algorithmica 43(4), 275-292 (2005)
2. Ferragina, P., Luccio, F., Manzini, C., Muthukrishnan, S.: Structuring labeled trees for optimal succinctness, and beyond. In: Proceedings of the IEEE Symposium on FOCS, pp. 184-196 (2005)
3. Ferragina, P., Manzini, G.: Indexing Compressing texts. JACM, 52(4), 552-581, (2005)
4. Golynski, A., Munro, J.I., Rao, S.S.: Rank/select operations on large alphabets: a tool for text indexing. In: SODA, pp. 368-373 (2006)
5. Grossi, R., Gupta, A., Vitter, J.S.: High-order entropy-compressed text indexes. In: SODA (2003)
6. Grossi, R., Vitter, J.S.: Compressed suffix arrays and suffix trees with applications to text indexing and string matching. In: STOC, vol. 32 (2000)
7. Hagerup, T., Miltersen, P., Pagh, R.: Deterministic dictionaries. Journal of Algorithms 41(1), 353-363 (2001)
8. Hon, W.K., Sadakane, K., Sung, W.K.: Succinct data structures for searchable partial sums. In: ISAAC, pp. 505-516 (2003)
9. Jacobson, G.: Succinct static data structures. Technical Report CMU-CS-89-112, Dept. of Computer Science, Carnegie-Mellon University (1989)
10. Navarro, G., Ferragina, P., Manzini, G., Mäkinen, V.: Succinct representation of sequences and full-text indexes. TALG (to appear, 2006)
11. Navarro, G., Mäkinen, V.: Compressed full-text indexes. ACM Computing Surveys (to appear, 2006)
12. Navarro, G., Mäkinen, V.: Dynamic entropy-compressed sequences and full-text indexes. In: CPM, pp. 306-317 (2006)
13. Patrascu, M., Demaine, E.: Logarithmic lower bounds in the cell-probe model. SIAM Journal on Computing 35(4), 932-963 (2006)
14. Raman, R., Raman, V., Rao, S.: Succinct dynamic data structures. In: WADS, pp. 426-437 (2001)
15. Raman, R., Raman, V., Rao, S.S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In: SODA, pp. 233-242 (2002)
16. Sadakane, K., Grossi, R.: Squeezing succinct data structures into entropy bounds. In: SODA, pp. 1230-1239 (2006)