Succinct ordinal trees with level-ancestor queries

ACM Transactions on Algorithms

Volumn 2, Issue 4, 2006, Pages 510-534

  Geary, Richard F ^a   Raman, Rajeev ^a   Raman, Venkatesh ^b  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

^b INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

Succinct data structures; XML document representation

Indexed keywords

DATA STRUCTURES; INFORMATION RETRIEVAL SYSTEMS; NAVIGATION SYSTEMS; QUERY LANGUAGES; RANDOM ACCESS STORAGE; SET THEORY; XML;

LEVEL-ANCESTOR OPERATION; STATIC ROOTED TREES; SUCCINCT ORDINAL TREES; XML DOCUMENT REPRESENTATION;

TREES (MATHEMATICS);

EID: 33846642491     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1198513.1198516     Document Type: Conference Paper

References (20)

1. ALSTRUP, S., AND HOLM, J. 2000. Improved algorithms for finding level ancestors in dynamic trees. In Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Proceedings. Lecture Notes in Computer Science, vol. 1853. Springer-Verlag, New York, pp. 73-84.
2. APACHE SOFTWARE FOUNDATION. 2005. Apache Xindice: Frequently Asked Questions. http://xml.apache.org/xindice/faq.html, October.
3. BENDER, M. A., AND FARACH-COLTON, M. 2002. The level ancestor problem simplified. In LATIN 2002: Theoretical Informatics, 5th Latin American Symposium, Proceedings. Lecture Notes in Computer Science, vol. 2286. Springer-Verlag, New York, pp. 508-515.
4. BENOIT, D. A., DEMAINE,E. D., MUNRO, J. I.,RAMAN,R.,RAMAN, V.,AND RAO, S. S. 2005. Representing trees of higher degree. Algorithmica 43, 275-292.
5. BENOIT, D. A., DEMAINE, E. D., MUNRO, J. I., AND RAMAN, V. 1999. Representing trees of higher degree. In Algorithms and Data Structures, 6th International Workshop, WADS '99, Proceedings. Lecture Notes in Computer Science, vol. 1663. Springer-Verlag, New York, pp. 169-180.
6. BERKMAN, O., AND VISHKIN, U. 1994. Finding level-ancestors in trees. J. Comput. Syst. Sci. 48, 214-230.
7. HAZELLE, B. 1987. Computing on a free tree via complexity-preserving mappings. Algorithmica 2, 337-361.
8. HIANG, Y.-T., LIN, C.-C., AND LU, H.-I. 2005. Orderly spanning trees with applications. SIAM J. Comput. 34, 924-945.
9. (Preliminary version in SODA 2001.)
10. LARK, D., AND MUNRO, J. I. 1996. Efficient suffix trees on secondary storage (extended Abstract). In Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, pp. 383-391.
11. LARK, J., AND DEROSE, S. 1999. XML path language (XPath) Version 1.0. W3C Recommendation. http://www.w3.org/TR/xpath, W3C Consortium.
12. IETZ, P. F. 1991. Finding level-ancestors in dynamic trees. In Algorithms and Data Structures, 2nd Workshop WADS '91, Proceedings. Lecture Notes in Computer Science, vol. 519. Springer-Verlag, New York, pp. 32-40.
13. FARACH, M., AND MUTHUKRISHNAN, S. 1996. Perfect hashing for strings: formalization and algorithms. In Combinatorial Pattern Matching, 7th Annual Symposium, CPU 96, Proceedings. Lecture Notes in Computer Science, vol. 1075. Springer-Verlag, New York, pp. 130-140.
14. FERRAGINA, P., LUCCIO, F., MANZINI, G., AND MUTHUKRISHNAN, S. 2005. Structuring labeled trees for optimal succinctness, and beyond. In Proceedings of the 46th IEEE Symposium on Foundations of Computer Science (FOCS), IEEE Computer Society Press, Los Alamitos, CA. pp. 184-196.
15. E HORS, A., LE HÉGARET, P., WOOD, L., NICOL, G., ROBIE, J., CHAMPION, M., AND BYRNE, S. 2000. Document object model (DOM) level 2 core specification Version 1.0. W3C Recommendation. http://www.w3.org/TR/DOM-Level-2- Core, W3C Consortium.
16. JACOBSON, G. 1989. Space-efficient static trees and graphs. In Proceedings of the 30th IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, pp. 549-554.
17. UNRO, J. I., AND RAMAN, V. 2001. Succinct representation of balanced parentheses and static trees. SIAM J. Comput. 31, 762-776.
18. UNRO, J. I., ANDRAO, S. S. 2004. Succinct representations of functions. In Proceedings of the 31st International Colloquium on Automata, Languages and Computation, Lecture Notes in Computer Science, vol. 3142, Springer-Verlag, New York, pp. 1006-1015.
19. RAMAN, R., RAMAN, V., AND RAO, S. S. 2002. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, 233-242.
20. RUDIN, W. 1987. Real & Complex Analysis, 3rd ed. McGraw-Hill, Englewood, Cliffs, N.J.