Engineering the LOUDS succinct tree representation

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

Volumn 4007 LNCS, Issue , 2006, Pages 134-145

  Delpratt, O'Neil ^a   Rahman, Naila ^a   Raman, Rajeev ^a  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; RANDOM ACCESS STORAGE; TREES (MATHEMATICS); XML;

CONCEPTUAL SIMPLICITY; LEVEL-ORDER UNARY DEGREE SEQUENCE (LOUDS); NAVIGATIONAL OPERATIONS; PARENTHESIS SEQUENCE;

COMPUTER NETWORKS;

EID: 33746086325     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11764298_12     Document Type: Conference Paper

References (15)

1. D. Benoit, E. D. Demaine, J. I. Munro, R. Raman, V. Raman and S. S. Rao, Representing trees of higher degree. Algorithmica 43 (2005), pp. 275-292.
2. Chiang, Y.-T., Lin, C.-C. and Lu, H.-I. Orderly spanning trees with applications. SIAM Journal on Computing, 34 (2005), pp. 924-945.
3. D. Clark and J. I. Munro. Efficient suffix trees on secondary storage. In Proc. 7th ACM-SIAM SODA, pp. 383-391, 1996.
4. R. F. Geary, N. Rahman, R. Raman and V. Raman. A simple optimal representation for balanced parentheses. In Proc. 15th Symposium on Combinatorial Pattern Matching, Springer LNCS 3109, pp. 159-172, 2004.
5. R. F. Geary, R. Raman and V. Raman. Succinct ordinal trees with level-ancestor queries. In Proc. 15th ACM-SIAM SODA, pp. 1-10, 2004.
6. G. Jacobson. Space-efficient static trees and graphs. In Proc. 30th FOCS, 549-554, 1989.
7. D. K. Kim, J. C. Na, J. E. Kim and K. Park. Efficient implementation of Rank and Select functions for succinct representation. In Proc. 4th Intl. Wkshp. Efficient and Experimental Algorithms, LNCS 3505, pp. 315-327, 2005.
8. J. I. Munro. Tables. In Proc. 16th FST&TCS conference, LNCS 1180, 37-42, 1996.
9. J. I. Munro and V. Raman. Succinct representation of balanced parentheses and static trees. SIAM J. Computing, 31 (2001), pp. 762-776.
10. J. I. Munro, and S. S. Rao, Succinct representations of functions. In Proc. 31st ICALP, LNCS 3142, pp. 1006-1015, 2004.
11. H. W. Martin and B. J. Orr. A random binary tree generator. Proceedings of the 17th ACM Annual Computer Science Conference, pp. 33-38, 1989.
12. http://xml.apache.org/xindice/FAQ.
13. Centerpoint XML, http://www.cppintc.com/XML.
14. UW XML Repository. http://www.cs.washington.edu/research/xmldatasets/.
15. http://www.w3.org/TR/2000/CR-DOM-Level-2-20000510/traversal.html