The tree inclusion problem: In optimal space and faster

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 66-77

  Bille, Philip ^a   Gørtz, Inge Li ^a  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; INCLUSIONS; TREES (MATHEMATICS); XML;

NODES; OPTIMAL SPACE; TREE INCLUSION; XML DATABASES;

DATABASE SYSTEMS;

EID: 26444475832     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_6     Document Type: Conference Paper

References (18)

1. L. Alonso and R. Schott. On the tree inclusion problem. In Proc. of Math. Foundations of Computer Science, pages 211-221, 1993.
2. S. Alstrup, J. Holm, K. de Lichtenberg, and M. Thorup. Minimizing diameters of dynamic trees. In Proc. of Intl. Coll. on Automata, Languages and Programming (ICALP), pages 270-280, 1997.
3. P. Bille and I. Gørtz. The tree inclusion problem: In optimal space and faster. Technical Report TR-2005-54, IT University of Copenhagen, January 2005.
4. W. Chen. More efficient algorithm for ordered tree inclusion. J. Algorithms, 26:370-385, 1998.
5. P. F. Dietz. Fully persistent arrays. In Proc. of Workshop on Algorithms and Data Structures (WADS), pages 67-74, 1989.
6. T. Hagerup, P. B. Miltersen, and R. Pagh. Deterministic dictionaries. J. Algorithms, 41(1):69-85, 2001.
7. D. Harel and R. E. Tarjan. Fast algorithms for finding nearest common ancestors. SI AM J. Comput., 13(2):338-355, 1984.
8. P. Kilpeläinen. Tree Matching Problems with Applications to Structured Text Databases. PhD thesis, University of Helsinki, Department of Computer Science, 1992.
9. P. Kilpeläinen and H. Mannila. Retrieval from hierarchical texts by partial patterns. In Proc. of Conf. on Research and Development in Information Retrieval, pages 214-222, 1993.
10. P. Kilpeläinen and H. Mannila. Ordered and unordered tree inclusion. SIAM J. Comp., 24:340-356, 1995.
11. D. E. Knuth. The Art of Computer Programming, Volume 1. Addison Wesley, 1969.
12. H. Mannila and K. J. Räihä. On query languages for the p-string data model. Information Modelling and Knowledge Bases, pages 469-482, 1990.
13. S. Muthukrishnan and M. Müller. Time and space efficient method-lookup for object-oriented programs. In Proc. of Symp. on Discrete Algorithms, pages 42-51, 1996.
14. T. Richter. A new algorithm for the ordered tree inclusion problem. In Proc. of Symp. on Combinatorial Pattern Matching (CPM), pages 150-166, 1997.
15. T. Schlieder and H. Meuss. Querying and ranking XML documents. J. Am. Soc. Inf. Sci. Technol., 53(6):489-503, 2002.
16. T. Schlieder and F. Naumann. Approximate tree embedding for querying XML data. In Proc. of Workshop On XML and Information Retrieval, 2000.
17. H. Yang, L. Lee, and W. Hsu. Finding hot query patterns over an xquery stream. The VLDB Journal, 13(4):318-332, 2004.
18. L. H. Yang, M. L. Lee, and W. Hsu. Efficient mining of XML query patterns for caching. In Proc. of Conference on Very Large Databases (VLDB), pages 69-80, 2003.