{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:42:16Z","timestamp":1742971336015,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":14,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387355443"},{"type":"electronic","value":"9780387399409"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-0-387-39940-9_1563","type":"book-chapter","created":{"date-parts":[[2009,9,16]],"date-time":"2009-09-16T08:53:09Z","timestamp":1253091189000},"page":"3650-3654","source":"Crossref","is-referenced-by-count":0,"title":["XML Types"],"prefix":"10.1007","author":[{"given":"Frank","family":"Neven","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"1563_CR1_1563","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0304-3975(93)90287-4","volume":"120","author":"A. Br\u00fcggemann-Klein","year":"1993","unstructured":"Br\u00fcggemann-Klein A. Regular expressions into finite automata. Theor. Comput. Sci., 120(2):197\u2013213, 1993.","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"1563_CR2_1563","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1006\/inco.1997.2688","volume":"140","author":"A. Br\u00fcggemann-Klein","year":"1998","unstructured":"Br\u00fcggemann-Klein A. and Wood D. One unambiguous regular languages. Inform. Comput., 140(2):229\u2013253, 1998.","journal-title":"Inform. Comput."},{"key":"1563_CR3_1563","unstructured":"Br\u00fcggemann-Klein A., Murata M., and Wood D. Regular tree and regular hedge languages over unranked alphabets. Technical Report HKUST-TCSC-2001-0, The Hongkong University of Science and Technology, 2001."},{"key":"1563_CR4_1563","doi-asserted-by":"crossref","unstructured":"Carme J., Niehren J., and Tommasi M. Querying unranked trees with stepwise tree automata. In Proc. 15th Int. Conf. Rewriting Techniques and Applications, 2004, pp. 105\u2013118.","DOI":"10.1007\/978-3-540-25979-4_8"},{"key":"1563_CR5_1563","doi-asserted-by":"crossref","unstructured":"Cristau J., L\u00f6ding C., and Thomas W. Deterministic automata on unranked trees. In Proc. 15th Int. Symp. Fundamentals of Computation Theory, 2005, pp. 68\u201379.","DOI":"10.1007\/11537311_7"},{"issue":"1\u20133","key":"1563_CR6_1563","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/j.tcs.2006.05.004","volume":"360","author":"H. Hosoya","year":"2006","unstructured":"Hosoya H. and Murata M. Boolean operations and inclusion test for attribute-element constraints. Theor. Comput. Sci., 360(1\u20133):327\u2013351, 2006.","journal-title":"Theor. Comput. Sci."},{"key":"1563_CR7_1563","doi-asserted-by":"crossref","unstructured":"Martens W., Neven F., and Schwentick T. Simple off the shelf abstractions for XML schema. ACM SIGMOD Rec., 36(4):15\u201322, 2007.","DOI":"10.1145\/1324185.1324188"},{"issue":"3","key":"1563_CR8_1563","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1145\/1166074.1166076","volume":"31","author":"W. Martens","year":"2006","unstructured":"Martens W., Neven F., Schwentick T., and Bex G.J. Expressiveness and complexity of XML schema. ACM Trans. Database Syst., 31(3):770\u2013813, 2006.","journal-title":"ACM Trans. Database Syst."},{"key":"1563_CR9_1563","doi-asserted-by":"crossref","unstructured":"Martens W. and Niehren J. Minimizing tree automata for unranked trees. In Proc. 10th Int. Workshop on Database Programming Languages, 2005, pp. 232\u2013246.","DOI":"10.1007\/11601524_15"},{"issue":"4","key":"1563_CR10_1563","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1145\/1111627.1111631","volume":"5","author":"M. Murata","year":"2005","unstructured":"Murata M., Lee D., Mani M., and Kawaguchi K. Taxonomy of XML schema languages using formal language theory. ACM Trans. Internet Tech., 5(4):660\u2013704, 2005.","journal-title":"ACM Trans. Internet Tech."},{"key":"1563_CR11_1563","doi-asserted-by":"crossref","unstructured":"Neven F. Automata theory for XML researchers. ACM SIGMOD Rec., 31(3):39\u201346, 2002.","DOI":"10.1145\/601858.601869"},{"key":"1563_CR12_1563","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. and Schwentick T. Query automata on finite trees. Theor. Comput. Sci., 275:633\u2013674, 2002.","journal-title":"Theor. Comput. Sci."},{"key":"1563_CR13_1563","doi-asserted-by":"crossref","unstructured":"Segoufin L. and Vianu V. Validating streaming XML documents. In Proc. 21st ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, 2002, pp. 53\u201364.","DOI":"10.1145\/543613.543622"},{"issue":"4","key":"1563_CR14_1563","doi-asserted-by":"crossref","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 finite automata theory. J. Comput. Syst. Sci., 1(4):317\u2013322, 1967.","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Encyclopedia of Database Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-39940-9_1563","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T04:59:49Z","timestamp":1590987589000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-39940-9_1563"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9780387355443","9780387399409"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-39940-9_1563","relation":{},"subject":[],"published":{"date-parts":[[2009]]}}}