{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T08:53:35Z","timestamp":1762505615447},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540242888"},{"type":"electronic","value":"9783540305705"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30570-5_5","type":"book-chapter","created":{"date-parts":[[2010,7,4]],"date-time":"2010-07-04T18:38:07Z","timestamp":1278268687000},"page":"68-82","source":"Crossref","is-referenced-by-count":19,"title":["Which XML Schemas Admit 1-Pass Preorder Typing?"],"prefix":"10.1007","author":[{"given":"Wim","family":"Martens","sequence":"first","affiliation":[]},{"given":"Frank","family":"Neven","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Schwentick","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: STOC 2004, pp. 202\u2013211 (2004)","DOI":"10.1145\/1007352.1007390"},{"key":"5_CR2","unstructured":"Br\u00fcggemann-Klein, A., Murata, M., Wood, D.: Regular tree and regular hedge languages over unranked alphabets: Version 1, April 3, 2001. Technical Report HKUST-TCSC-2001-0, The Hongkong University of Science and Technology (2001)"},{"issue":"2","key":"5_CR3","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1006\/inco.1997.2695","volume":"142","author":"A. Br\u00fcggemann-Klein","year":"1998","unstructured":"Br\u00fcggemann-Klein, A., Wood, D.: One-unambiguous regular languages. Information and Computation\u00a0142(2), 182\u2013206 (1998)","journal-title":"Information and Computation"},{"key":"5_CR4","unstructured":"World Wide\u00a0Web Consortium. Extensible Markup Language (XML), http:\/\/www.w3.org\/XML"},{"key":"5_CR5","unstructured":"World Wide\u00a0Web Consortium. XML Schema, http:\/\/www.w3.org\/XML\/Schema"},{"key":"5_CR6","unstructured":"World Wide\u00a0Web Consortium. XML Schema Part 0: Primer, http:\/\/www.w3.org\/TR\/xmlschema-0\/"},{"key":"5_CR7","unstructured":"World Wide\u00a0Web Consortium. XML Schema Part 1: Structures, http:\/\/www.w3.org\/TR\/xmlschema-1\/"},{"issue":"2","key":"5_CR8","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1145\/767193.767195","volume":"3","author":"H. Hosoya","year":"2003","unstructured":"Hosoya, H., Pierce, B.C.: XDuce: A statically typed XML processing language. ACM Transactions on Internet Technology (TOIT)\u00a03(2), 117\u2013148 (2003)","journal-title":"ACM Transactions on Internet Technology (TOIT)"},{"key":"5_CR9","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/978-3-540-24607-7_15","volume-title":"Database Programming Languages","author":"Christoph Koch","year":"2004","unstructured":"Koch, C., Scherzinger, S.: Attribute grammars for scalable query processing on XML streams. In: DBPL, pp. 233\u2013256 (2003)"},{"key":"5_CR10","unstructured":"Mani, M.: Keeping chess alive - Do we need 1-unambiguous content models? In: Extreme Markup Languages, Montreal, Canada (2001)"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/3-540-36285-1_5","volume-title":"Database Theory - ICDT 2003","author":"W. Martens","year":"2002","unstructured":"Martens, W., Neven, F.: Typechecking top-down uniform unranked tree transducers. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol.\u00a02572, pp. 64\u201378. Springer, Heidelberg (2002)"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Martens, W., Neven, F.: Frontiers of tractability for typechecking simple XML transformations. In: PODS 2004, pp. 23\u201334 (2004)","DOI":"10.1145\/1055558.1055563"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1007\/978-3-540-28629-5_70","volume-title":"Mathematical Foundations of Computer Science 2004","author":"W. Martens","year":"2004","unstructured":"Martens, W., Neven, F., Schwentick, T.: Complexity of decision problems for simple regular expressions. In: Fiala, J., Koubek, V., Kratochv\u00edl, J. (eds.) MFCS 2004. LNCS, vol.\u00a03153, pp. 889\u2013900. Springer, Heidelberg (2004)"},{"key":"5_CR14","unstructured":"Murata, M., Lee, D., Mani, M.: Taxonomy of XML schema languages using formal language theory. In: Extreme Markup Languages, Montreal, Canada (2001)"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/3-540-45793-3_2","volume-title":"Computer Science Logic","author":"F. Neven","year":"2002","unstructured":"Neven, F.: Automata, logic, and XML. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol.\u00a02471, pp. 2\u201326. Springer, Heidelberg (2002)"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/335168.335173","volume-title":"PODS 2000","author":"Y. Papakonstantinou","year":"2000","unstructured":"Papakonstantinou, Y., Vianu, V.: DTD inference for views of XML data. In: PODS 2000, pp. 35\u201346. ACM Press, New York (2000)"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/3-540-36285-1_4","volume-title":"Database Theory - ICDT 2003","author":"Y. Papakonstantinou","year":"2002","unstructured":"Papakonstantinou, Y., Vianu, V.: Incremental validation of XML documents. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol.\u00a02572, pp. 47\u201363. Springer, Heidelberg (2002)"},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1145\/543613.543622","volume-title":"PODS 2002","author":"L. Segoufin","year":"2002","unstructured":"Segoufin, L., Vianu, V.: Validating streaming XML documents. In: PODS 2002, pp. 53\u201364. ACM Press, New York (2002)"},{"issue":"3","key":"5_CR19","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1137\/0219027","volume":"19","author":"H. Seidl","year":"1990","unstructured":"Seidl, H.: Deciding equivalence of finite tree automata. SIAM Journal on Computing\u00a019(3), 424\u2013437 (1990)","journal-title":"SIAM Journal on Computing"},{"key":"5_CR20","unstructured":"Sperberg-McQueen, C.M.: XML Schema 1.0: A language for document grammars. In: XML 2003 - Conference Proceedings (2003)"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time: Preliminary report. In: STOC 1973, pp. 1\u20139 (1973)","DOI":"10.1145\/800125.804029"},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-46093-4_1","volume-title":"Database Programming Languages","author":"D. Suciu","year":"2001","unstructured":"Suciu, D.: Typechecking for semistructured data. In: Ghelli, G., Grahne, G. (eds.) DBPL 2001. LNCS, vol.\u00a02397, p. 1. Springer, Heidelberg (2001)"},{"key":"5_CR23","volume-title":"XML Schema","author":"E. Vlist van der","year":"2002","unstructured":"van der Vlist, E.: XML Schema. O\u2019Reilly, Sebastopol (2002)"},{"key":"5_CR24","volume-title":"Relax NG","author":"E. Vlist van der","year":"2003","unstructured":"van der Vlist, E.: Relax NG. O\u2019Reilly, Sebastopol (2003)"}],"container-title":["Lecture Notes in Computer Science","Database Theory - ICDT 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30570-5_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:23:20Z","timestamp":1605759800000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30570-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540242888","9783540305705"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30570-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}