{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T18:31:06Z","timestamp":1781893866020,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540221531","type":"print"},{"value":"9783540259794","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25979-4_8","type":"book-chapter","created":{"date-parts":[[2010,9,11]],"date-time":"2010-09-11T01:32:53Z","timestamp":1284168773000},"page":"105-118","source":"Crossref","is-referenced-by-count":38,"title":["Querying Unranked Trees with Stepwise Tree Automata"],"prefix":"10.1007","author":[{"given":"Julien","family":"Carme","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joachim","family":"Niehren","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marc","family":"Tommasi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"Baumgartner, R., Flesca, S., Gottlob, G.: Visual web information extraction with Lixto. The Very Large Data Bases Journal, 119\u2013128 (2001)"},{"key":"8_CR2","unstructured":"Berlea, A., Seidl, H.: Binary queries. In: Proceedings of Extreme Markup Languages, Montreal (2002)"},{"key":"8_CR3","unstructured":"Br\u00fcggemann-Klein, A., Murata, M., Wood, D.: Regular tree and regular hedge languages over unranked alphabets. Technical report (2001)"},{"key":"8_CR4","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications. Online book, 450 pages. Available at (1997), http:\/\/www.grappa.univ-lille3.fr\/tata"},{"key":"8_CR5","first-page":"93","volume-title":"Resolution of Equations in Algebraic Structures, Algebraic Techniques","author":"B. Courcelle","year":"1989","unstructured":"Courcelle, B.: On recognizable sets and tree automata. In: Ait-Kaci, H., Nivat, M. (eds.) Resolution of Equations in Algebraic Structures, Algebraic Techniques, vol.\u00a01, ch. 3, pp. 93\u2013126. Academic Press, London (1989)"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Frick, M., Grohe, M., Koch, C.: Query evaluation on compressed trees. In: Proceedings of the IEEE Symposium on Logic In Computer Sciences, Ottawa (2003)","DOI":"10.1109\/LICS.2003.1210058"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Koch, C.: Monadic datalog and the expressive power of languages for web information extraction. In: Proceedings of the ACM Symposium on Principle of Databases Systems, pp. 17\u201328 (2002)","DOI":"10.1145\/543613.543617"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Koch, C.: Monadic queries over tree-structured data. In: Proceedings of the IEEE Symposium on Logic In Computer Sciences, Copenhagen (2002)","DOI":"10.1109\/LICS.2002.1029828"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Koch, C., Pichler, R.: The complexity of XPATH query evaluation. In: Proceedings of the ACM Symposium on Principle of Databases Systems, pp. 179\u2013190 (2003)","DOI":"10.1145\/773153.773171"},{"issue":"2","key":"8_CR10","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1145\/776985.776988","volume":"32","author":"G. Gottlob","year":"2003","unstructured":"Gottlob, G., Koch, C., Pichler, R.: XPATH processing in a nutshell. ACM SIGMOD Record\u00a032(2), 21\u201327 (2003)","journal-title":"ACM SIGMOD Record"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Koch, C.: Efficient processing of expressive node-selecting queries on XML data in secondary storage: A tree automata-based approach. In: Proceedings of the International Conference on Very Large Data Bases (2003)","DOI":"10.1016\/B978-012722442-8\/50030-6"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Neumann, A., Seidl, H.: Locating matches of tree patterns in forests. Foundations of Software Technology and Theoretical Computer Science, 134\u2013145 (1998)","DOI":"10.1007\/978-3-540-49382-2_12"},{"issue":"1-2","key":"8_CR13","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1016\/S0304-3975(01)00301-2","volume":"275","author":"F. Neven","year":"2002","unstructured":"Neven, F., Schwentick, T.: Query automata over finite trees. Theoretical Computer Science\u00a0275(1-2), 633\u2013674 (2002)","journal-title":"Theoretical Computer Science"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1007\/3-540-56610-4_76","volume-title":"TAPSOFT \u201993: Theory and Practice of Software Development","author":"J. Niehren","year":"1993","unstructured":"Niehren, J., Podelski, A.: Feature automata and recognizable sets of feature trees. In: Gaudel, M.-C., Jouannaud, J.-P. (eds.) CAAP 1993, FASE 1993, and TAPSOFT 1993. LNCS, vol.\u00a0668, pp. 356\u2013375. Springer, Heidelberg (1993)"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Seidl, H., Schwentick, T., Muscholl, A.: Numerical document queries. In: Proc. of the IEEE Symposium on Principles of Database Systems, pp. 155\u2013166 (2003)","DOI":"10.1145\/773153.773169"},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S0022-0000(67)80022-9","volume":"1","author":"J.W. Thatcher","year":"1967","unstructured":"Thatcher, J.W.: Characterizing derivation trees of context-free grammars through a generalization of automata theory. J. of Comp. and Syst. Sci.\u00a01, 317\u2013322 (1967)","journal-title":"J. of Comp. and Syst. Sci."},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF01691346","volume":"2","author":"J.W. Thatcher","year":"1968","unstructured":"Thatcher, J.W., Wright, J.B.: Generalized finite automata with an application to a decision problem of second-order logic. Math. System Theory\u00a02, 57\u201382 (1968)","journal-title":"Math. System Theory"},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/3-540-44881-0_18","volume-title":"Rewriting Techniques and Applications","author":"S.D. Zilio","year":"2003","unstructured":"Zilio, S.D., Lugiez, D.: XML schema, tree logic and sheaves automata. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol.\u00a02706, pp. 246\u2013263. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25979-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T16:02:36Z","timestamp":1559664156000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-25979-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221531","9783540259794"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25979-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}