Succinct indexes for strings, binary relations and multilabeled trees

ACM Transactions on Algorithms

Volumn 7, Issue 4, 2011, Pages

  Barbay, Jérémy ^a   He, Meng ^b   Munro, J Ian ^b   Satti, Srinivasa Rao ^c  

^a UNIVERSITY OF CHILE   (Chile)

^b UNIVERSITY OF WATERLOO   (Canada)

^c Seoul National University   (South Korea)

Author keywords

Binary relations; Compressed text indexes; Labeled trees; Multilabeled trees; Strings; Succinct data structures; Succinct indexes; Text indexing; Trees

Indexed keywords

BINARY RELATION; COMPRESSED TEXT INDEXES; LABELED TREES; MULTILABELED TREES; STRINGS; SUCCINCT DATA STRUCTURE; SUCCINCT INDEXES; TEXT-INDEXING; TREES;

BINARY TREES; DESIGN; ENCODING (SYMBOLS); INFORMATION THEORY; PLANT EXTRACTS;

TREES (MATHEMATICS);

EID: 80053478956     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/2000807.2000820     Document Type: Article

References (36)

1. BARBAY, J. 2006. Adaptive search algorithm for patterns, in succinctly encoded XML. Tech. rep. CS-2006-11, University of Waterloo, Ontario, Canada.
2. BARBAY, J., GOLYNSKI, A., MUNRO, J. I., AND RAO, S. S. 2007. Adaptive searching in succinctly encoded binary relations and tree-structured documents. Theoret. Comput. Sci. 387, 3, 284-297. (Pubitemid 47633445)
3. BARBAY, J., HE, M., MUNRO, J. I., AND RAO, S. S. 2007. Succinct indexes for strings, binary relations and multi-labeled trees. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms. 680-689.
4. BENOIT, D., DEMAINE, E. D., MUNRO, J. I., RAMAN, R., RAMAN, V., AND RAO, S. S. 2005. Representing trees of higher degree. Algorithmica 43, 4, 275-292. (Pubitemid 43018037)
5. CLARK, D. R. AND MUNRO, J. I. 1996. Efficient suffix trees on secondary storage. In Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms. 383-391.
6. DELPRATT, O., RAHMAN, N., AND RAMAN, R. 2006. Engineering the LOUDS succinct tree representation. In Proceedings of the 5th International Workshop on Experimental Algorithms. 134-145. (Pubitemid 44070933)
7. DEMAINE, E. D. AND LÓPEZ-ORTIZ, A. 2003. A linear lower bound on index size for text retrieval. J. Algor. 48, 1, 2-15.
8. FERRAGINA, P., GIANCARLO, R., MANZINI, G., AND SCIORTINO, M. 2005a. Boosting textual compression in optimal linear time. J. ACM 52, 4, 688-713. (Pubitemid 43078375)
9. FERRAGINA, P., LUCCIO, F., MANZINI, G., AND MUTHUKRISHNAN, S. 2005b. Structuring labeled trees for optimal succinctness, and beyond. In Proceedings of the 46th IEEE Symposium on Foundations of Computer Science. 184-196.
10. FERRAGINA, P. AND MANZINI, G. 2005. Indexing compressed text. J. ACM 52, 4, 552-581. (Pubitemid 43078371)
11. FERRAGINA, P., MANZINI, G., MÄKINEN, V., AND NAVARRO, G. 2004. An alphabet-friendly FM-index. In Proceedings of the 11th Symposium on String Processing and Information Retrieval. Lecture Notes in Computer Science, vol. 3246. Springer-Verlag, 150-160.
12. GÁL, A. AND MILTERSEN, P. B. 2003. The cell probe complexity of succinct data structures. In Proceedings of the 30th International Colloquium on Automata, Languages and Programming. 332-344.
13. GEARY, R. F., RAMAN, R., AND RAMAN, V. 2006. Succinct ordinal trees with level-ancestor queries. ACM Trans. Algor. 2, 4, 510-534. (Pubitemid 46174059)
14. GIANCARLO, R. AND SCIORTINO, M. 2003. Optimal partitions of strings: A new class of Burrows-Wheeler compression algorithms. In Proceedings of the 14th Annual Symposium on Combinatorial Pattern Matching. 129-143.
15. GOLYNSKI, A. 2007. Optimal lower bounds for rank and select indexes. Theoret. Comput. Sci. 387, 3, 348-359. (Pubitemid 47633448)
16. GOLYNSKI, A., MUNRO, J. I., AND RAO, S. S. 2006. Rank/select operations on large alphabets: A tool for text indexing. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms. 368-373. (Pubitemid 43275258)
17. GONNET, G. H., BAEZA-YATES, R. A., AND SNIDER, T. 1992. New indices for text: PAT trees and PAT arrays. In Information Retrieval: Data Structures & Algorithms. Prentice-Hall, Chapter 5, 66-82.
18. GONZÁLEZ, R. AND NAVARRO, G. 2006. Statistical encoding of succinct data structures. In Proceedings of the 17th Annual Symposium on Combinatorial Pattern Matching. 294-305. (Pubitemid 44071995)
19. GROSSI, R., GUPTA, A., AND VITTER, J. S. 2003. High-order entropy-compressed text indexes. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms. 841-850.
20. GROSSI, R. AND VITTER, J. S. 2005. Compressed suffix arrays and suffix trees with applications to text indexing and string matching. SIAM J. Comput. 35, 2, 378-407.
21. GUSFIELD, D. 1997. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge, UK.
22. HE, M. 2007. Succinct indexes. Ph.D. dissertation, University of Waterloo.
23. HE, M., MUNRO, J. I., AND RAO, S. S. 2005. A categorization theorem on suffix arrays with applications to space efficient text indexes. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms. 23-32. (Pubitemid 40851354)
24. JACOBSON, G. 1989. Space-efficient static trees and graphs. In Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science. 549-554. (Pubitemid 20726002)
25. JANSSON, J., SADAKANE, K., AND SUNG, W.-K. 2007. Ultra-succinct representation of ordered trees. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms.
26. MANBER, U. AND MYERS, E. W. 1993. Suffix arrays: a new method for on-line string searches. SIAM J. Com-put. 22, 5, 935-948.
27. MILTERSEN, P. B. 2005. Lower bounds on the size of selection and rank indexes. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms. 11-12. (Pubitemid 40851352)
28. MORTENSEN, C. W. 2003. Fully-dynamic two dimensional orthogonal range and line segment intersection reporting in logarithmic time. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms. 618-627.
29. MORTENSEN, C. W. 2006. Fully dynamic orthogonal range reporting on RAM. SIAM J. Comput. 35, 6, 1494-1525. (Pubitemid 44935687)
30. MUNRO, J. I., RAMAN, R., RAMAN, V., AND RAO, S. S. 2003. Succinct representations of permutations. In Proceedings of the 30th International Colloquium on Automata, Languages and Programming. 345-356.
31. MUNRO, J. I. AND RAMAN, V. 2001. Succinct representation of balanced parentheses and static trees. SIAM J. Comput. 31, 3, 762-776. (Pubitemid 34750554)
32. RAMAN, R., RAMAN, V., AND SATTI, S. R. 2007. Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. ACM Trans. Algor. 3, 4, 43.
33. SADAKANE, K. AND GROSSI, R. 2006. Squeezing succinct data structures into entropy bounds. In Proceedings of the 17th annual ACM-SIAM Symposium on Discrete Algorithms. 1230-1239. (Pubitemid 43275351)
34. VAN EMDE BOAS, P., KAAS, R., AND ZIJLSTRA, E. 1977. Design and implementation of an efficient priority queue. Math. Syst. Theory 10, 99-127.
35. WILLARD, D.E. 1983. Log-logarithmic worst-case range queries are possible in space &(N). Inf. Proc. Lett. 17, 2, 81-84.
36. ZHANG, N., OZSU, M. T., ABOULNAGA, A., AND ILYAS, I. F. 2006. XSEED: Accurate and fast cardinality estimation for XPath queries. In Proceedings of the 22nd International Conference on Data Engineering. 61-72.