Succinct indexes for strings, binary relations and multi-labeled trees

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 07-09-January-2007, Issue , 2007, Pages 680-689

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

^a UNIVERSITY OF WATERLOO   (Canada)

^b IT UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY TREES; BINS; DESIGN; ENCODING (SYMBOLS); FORESTRY; INFORMATION THEORY; PATTERN MATCHING;

AUXILIARY DATA STRUCTURES; BINARY RELATION; CONSTANT TIME; INFORMATION-THEORETIC LOWER BOUNDS; INTEGRATED DATA; LABELED TREES; SIGMA FACTOR; TEXT INDICES;

TREES (MATHEMATICS);

EID: 84969245494     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Jérémy Barbay. Adaptive search algorithm for patterns, in succinctly encoded XML. Technical Report CS-2006-11, University of Waterloo, Ontario, Canada, 2006.
2. Jeremy Barbay, Alexander Golynski, J. Ian Munro, and S. Srinivasa Rao. Adaptive searching in succinctly encoded binary relations and tree-structured documents. In Proceedings of the 17th Annual Symposium on Combinatorial Pattern Matching, pages 24-35. Springer-Verlag LNCS 4009, 2006.
3. David Benoit, Erik D. Demaine, J. Ian Munro, Rajeev Raman, Venkatesh Raman, and S. Srinivasa Rao. Representing trees of higher degree. Algorith-mica, 43(4):275-292, 2005.
4. David R. Clark and J. Ian Munro. Efficient suffix trees on secondary storage. In Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 383-391, 1996.
5. Erik D. Demaine and Alejandro Lopez-Ortiz. A linear lower bound on index size for text retrieval. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 289-294, 2001.
6. Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini, and S. Muthukrishnan. Structuring labeled trees for optimal succinctness, and beyond. In Proceedings of the 16th IEEE Symposium on Foundations of Computer Science, pages 184-196, 2005.
7. Paolo Ferragina, Giovanni Manzini, Veli Mäkinen, and Gonzalo Navarro. An alphabet-friendly FM-index. In Proceedings of the 11th Symposium on String Processing and Information Retrieval, pages 150-160. Springer-Verlag LNCS 3246, 2004.
8. Richard F. Geary, Rajeev Raman, and Venkatesh Raman. Succinct ordinal trees with level-ancestor queries. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1-10, 2004.
9. Alexander Golynski, J. Ian Munro, and S. Srinivasa Rao. Rank/select operations on large alphabets: a tool for text indexing. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 368-373, 2006.
10. Roberto Grossi, Ankur Gupta, and Jeffrey Scott Vitter. High-order entropy-compressed text indexes. In Proceedings of the lj-th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 841-850, 2003.
11. Meng He, J. Ian Munro, and S. Srinivasa Rao. A categorization theorem on suffix arrays with appli-cations to space efficient text indexes. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 23-32, 2005.
12. Guy Jacobson. Space-efficient static trees and graphs. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science, pages 549-554, 1989.
13. Jesper Jansson, Kunihiko Sadakane, and Wing-Kin Sung. Ultra-succinct representation of ordered trees. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, 2007.
14. Peter Bro Miltersen. Lower bounds on the size of selection and rank indexes. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 11-12, 2005.
15. J. Ian Munro, Rajeev Raman, Venkatesh Raman, and S. Srinivasa Rao. Succinct representations of permutations. In Proceedings of the 30th International Colloquium on Automata, Languages and Programming, pages 345-356, 2003.
16. J. Ian Munro and Venkatesh Raman. Succinct representation of balanced parentheses and static trees. SIAM Journal on Computing, 31(3):762-776, 2001.
17. Rajeev Raman, Venkatesh Raman, and S. Srinivasa Rao. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 233-242, 2002.
18. Kunihiko Sadakane and Roberto Grossi. Squeezing succinct data structures into entropy bounds. In Proceedings of the 17th annual ACM-SIAM Symposium on Discrete Algorithms, pages 1230-1239, 2006.
19. Dan E. Willard. Log-logarithmic worst-case range queries are possible in space O (TV). Information Processing Letters, 17(2):81-84, 1983.
20. Ning Zhang, M. Tamer Ozsu, Ashraf Aboulnaga, and Ihab F. Ilyas. XSEED: Accurate and Fast Cardinality Estimation for X Path Queries. In Proceedings of the 22nd International Conference on Data Engineering, pages 61-72, 2006.