{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:09:17Z","timestamp":1725559757367},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540275800"},{"type":"electronic","value":"9783540316916"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11523468_6","type":"book-chapter","created":{"date-parts":[[2010,7,18]],"date-time":"2010-07-18T18:58:59Z","timestamp":1279479539000},"page":"66-77","source":"Crossref","is-referenced-by-count":12,"title":["The Tree Inclusion Problem: In Optimal Space and Faster"],"prefix":"10.1007","author":[{"given":"Philip","family":"Bille","sequence":"first","affiliation":[]},{"given":"Inge","family":"Li G\u00f8rtz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Alonso, L., Schott, R.: On the tree inclusion problem. In: Proc. of Math. Foundations of Computer Science, pp. 211\u2013221 (1993)","DOI":"10.1007\/3-540-57182-5_13"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Alstrup, S., Holm, J., de Lichtenberg, K., Thorup, M.: Minimizing diameters of dynamic trees. In: Proc. of Intl. Coll. on Automata, Languages and Programming (ICALP), pp. 270\u2013280 (1997)","DOI":"10.1007\/3-540-63165-8_184"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Bille, P., G\u00f8rtz, I.: The tree inclusion problem. In: optimal space and faster. Technical Report TR-2005-54, IT University of Copenhagen (January 2005)","DOI":"10.1007\/11523468_6"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1006\/jagm.1997.0899","volume":"26","author":"W. Chen","year":"1998","unstructured":"Chen, W.: More efficient algorithm for ordered tree inclusion. J. Algorithms\u00a026, 370\u2013385 (1998)","journal-title":"J. Algorithms"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Dietz, P.F.: Fully persistent arrays. In: Proc. of Workshop on Algorithms and Data Structures (WADS), pp. 67\u201374 (1989)","DOI":"10.1007\/3-540-51542-9_8"},{"issue":"1","key":"6_CR6","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1006\/jagm.2001.1171","volume":"41","author":"T. Hagerup","year":"2001","unstructured":"Hagerup, T., Miltersen, P.B., Pagh, R.: Deterministic dictionaries. J. Algorithms\u00a041(1), 69\u201385 (2001)","journal-title":"J. Algorithms"},{"issue":"2","key":"6_CR7","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM J. Comput.\u00a013(2), 338\u2013355 (1984)","journal-title":"SIAM J. Comput."},{"key":"6_CR8","unstructured":"Kilpel\u00e4inen, P.: Tree Matching Problems with Applications to Structured Text Databases. PhD thesis, University of Helsinki, Department of Computer Science (1992)"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Kilpel\u00e4inen, P., Mannila, H.: Retrieval from hierarchical texts by partial patterns. In: Proc. of Conf. on Research and Development in Information Retrieval, pp. 214\u2013222 (1993)","DOI":"10.1145\/160688.160722"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1137\/S0097539791218202","volume":"24","author":"P. Kilpel\u00e4inen","year":"1995","unstructured":"Kilpel\u00e4inen, P., Mannila, H.: Ordered and unordered tree inclusion. SIAM J. Comp.\u00a024, 340\u2013356 (1995)","journal-title":"SIAM J. Comp."},{"key":"6_CR11","volume-title":"The Art of Computer Programming","author":"D.E. Knuth","year":"1969","unstructured":"Knuth, D.E.: The Art of Computer Programming, vol.\u00a01. Addison-Wesley, Reading (1969)"},{"key":"6_CR12","unstructured":"Mannila, H., R\u00e4ih\u00e4, K.J.: On query languages for the p-string data model. Information Modelling and Knowledge Bases, 469\u2013482 (1990)"},{"key":"6_CR13","unstructured":"Muthukrishnan, S., M\u00fcller, M.: Time and space efficient method-lookup for object-oriented programs. In: Proc. of Symp. on Discrete Algorithms, pp. 42\u201351 (1996)"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Richter, T.: A new algorithm for the ordered tree inclusion problem. In: Proc. of Symp. on Combinatorial Pattern Matching (CPM), pp. 150\u2013166 (1997)","DOI":"10.1007\/3-540-63220-4_57"},{"issue":"6","key":"6_CR15","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1002\/asi.10060","volume":"53","author":"T. Schlieder","year":"2002","unstructured":"Schlieder, T., Meuss, H.: Querying and ranking XML documents. J. Am. Soc. Inf. Sci. Technol.\u00a053(6), 489\u2013503 (2002)","journal-title":"J. Am. Soc. Inf. Sci. Technol."},{"key":"6_CR16","unstructured":"Schlieder, T., Naumann, F.: Approximate tree embedding for querying XML data. In: Proc. of Workshop On XML and Information Retrieval (2000)"},{"issue":"4","key":"6_CR17","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/s00778-004-0134-4","volume":"13","author":"H. Yang","year":"2004","unstructured":"Yang, H., Lee, L., Hsu, W.: Finding hot query patterns over an xquery stream. The VLDB Journal\u00a013(4), 318\u2013332 (2004)","journal-title":"The VLDB Journal"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Yang, L.H., Lee, M.L., Hsu, W.: Efficient mining of XML query patterns for caching. In: Proc. of Conference on Very Large Databases (VLDB), pp. 69\u201380 (2003)","DOI":"10.1016\/B978-012722442-8\/50015-X"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11523468_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T06:46:29Z","timestamp":1559285189000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11523468_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540275800","9783540316916"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11523468_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}