{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:15:09Z","timestamp":1759637709336},"reference-count":28,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3735,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1016\/s0022-0000(03)00032-1","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T01:09:12Z","timestamp":1052788152000},"page":"688-727","source":"Crossref","is-referenced-by-count":32,"title":["XML with data values: typechecking revisited"],"prefix":"10.1016","volume":"66","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[]},{"given":"Tova","family":"Milo","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Neven","sequence":"additional","affiliation":[]},{"given":"Dan","family":"Suciu","sequence":"additional","affiliation":[]},{"given":"Victor","family":"Vianu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(03)00032-1_BIB1","doi-asserted-by":"crossref","unstructured":"N. Alon, T. Milo, F. Neven, D. Suciu, V. Vianu, Typechecking XML views of relational databases, in: Proceedings of the 16th IEEE Symposium on Logic in Computer Science, Boston, MA, 2001, pp. 421\u2013430.","DOI":"10.1109\/LICS.2001.932517"},{"key":"10.1016\/S0022-0000(03)00032-1_BIB2","unstructured":"A. Bruggemann-Klein, M. Murata, D. Wood, Regular tree and regular hedge languages over non-ranked alphabets, Hong Kong University of Science and Technology Computer Science Center Research Report HKUST-TCSC-2001-05, 2001, available at http:\/\/www.cs.ust.hk\/tcsc\/RR\/2001-05.ps.gz."},{"key":"10.1016\/S0022-0000(03)00032-1_BIB3","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1002\/malq.19600060105","article-title":"Weak second-order arithmetic and finite automata","volume":"6","author":"B\u00fcchi","year":"1960","journal-title":"Z. Math. Logik Grundl. Math."},{"key":"10.1016\/S0022-0000(03)00032-1_BIB4","doi-asserted-by":"crossref","unstructured":"D. Chamberlin, J. Clark, D. Florescu, J. Robie, J. Simeon, M. Stefanescu, XQuery 1.0: an XML query language, 2001, available from the W3C, http:\/\/www.w3.org\/TR\/query.","DOI":"10.1007\/3-540-45271-0_1"},{"issue":"3","key":"10.1016\/S0022-0000(03)00032-1_BIB5","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1137\/0214049","article-title":"The implication problem for functional and inclusion dependencies is undecidable","volume":"14","author":"Chandra","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(03)00032-1_BIB6","doi-asserted-by":"crossref","unstructured":"V. Christophides, S. Cluet, J. Simeon, On wrapping query languages and efficient XML integration, in: Proceedings of the ACM SIGMOD International Conference on Management of Data, Dallas, TX, 2000, pp. 141\u2013152.","DOI":"10.1145\/342009.335395"},{"key":"10.1016\/S0022-0000(03)00032-1_BIB7","unstructured":"J. Clark, XSL transformations (XSLT) specification, 1999, http:\/\/www.w3.org\/TR\/WD-xslt."},{"key":"10.1016\/S0022-0000(03)00032-1_BIB8","doi-asserted-by":"crossref","unstructured":"S. Cluet, C. Delobel, J. Simeon, K. Smaga, Your mediators need data conversion! in: Proceedings of ACM-SIGMOD International Conference on Management of Data, Seattle, WA, 1998, pp. 177\u2013188.","DOI":"10.1145\/276304.276321"},{"key":"10.1016\/S0022-0000(03)00032-1_BIB9","doi-asserted-by":"crossref","unstructured":"A. Deutsch, M. Fernandez, D. Florescu, A. Levy, D. Suciu, A query language for XML, in: Proceedings of the Eighth International World Wide Web Conference (WWW8), Toronto, Canada, Computer Networks 31(11\u201316) (1999) 1155\u20131169.","DOI":"10.1016\/S1389-1286(99)00020-1"},{"key":"10.1016\/S0022-0000(03)00032-1_BIB10","series-title":"Finite Model Theory","author":"Ebbinghaus","year":"1999"},{"key":"10.1016\/S0022-0000(03)00032-1_BIB11","doi-asserted-by":"crossref","unstructured":"P. Fankhauser, M. Fernandez, A. Malhotra, M. Rys, J. Simeon, P. Wadler, XQuery 1.0 formal semantics, 2001, available from the W3C, http:\/\/www.w3.org\/TR\/query-semantics.","DOI":"10.1145\/603867.603870"},{"key":"10.1016\/S0022-0000(03)00032-1_BIB12","series-title":"Computers and Intractibility: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0022-0000(03)00032-1_BIB13","series-title":"Ramsey Theory","author":"Graham","year":"1990"},{"key":"10.1016\/S0022-0000(03)00032-1_BIB14","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0022-0000(03)00032-1_BIB15","doi-asserted-by":"crossref","unstructured":"H. Hosoya, B.C. Pierce, XDuce: an XML processing language (preliminary report), in: WebDB 2000 (selected papers), Lecture Notes in Computer Science, Springer, Berlin, 2000, pp. 226\u2013244.","DOI":"10.1007\/3-540-45271-0_15"},{"key":"10.1016\/S0022-0000(03)00032-1_BIB16","doi-asserted-by":"crossref","unstructured":"H. Hosoya, B.C. Pierce, Regular Expression Pattern Matching for XML, in: Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), London, U.K., 2001, pp. 67\u201380.","DOI":"10.1145\/360204.360209"},{"key":"10.1016\/S0022-0000(03)00032-1_BIB17","series-title":"The Definition of Standard ML","author":"Milner","year":"1990"},{"key":"10.1016\/S0022-0000(03)00032-1_BIB18","doi-asserted-by":"crossref","unstructured":"T. Milo, D. Suciu, Type inference for queries on semistructured data, in: Proceedings of the ACM Symposium on Principles of Database Systems, Philadelphia, PA, 1999, pp. 215\u2013226.","DOI":"10.1145\/303976.303998"},{"key":"10.1016\/S0022-0000(03)00032-1_BIB19","doi-asserted-by":"crossref","unstructured":"T. Milo, D. Suciu, V. Vianu, Typechecking for XML transformers, in: Proceedings of the SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, Dallas, TX, 2000, pp. 11\u201322.","DOI":"10.1145\/335168.335171"},{"issue":"3","key":"10.1016\/S0022-0000(03)00032-1_BIB20","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/S0019-9958(83)80002-3","article-title":"The implication problem for functional and inclusion dependencies","volume":"56","author":"Mitchell","year":"1983","journal-title":"Inform. Control"},{"key":"10.1016\/S0022-0000(03)00032-1_BIB21","doi-asserted-by":"crossref","unstructured":"M. Murata. Transformation of documents and schemas by patterns and contextual conditions, in: Proceedings of Third International Workshop on Principles of Document Processing (PODP), Palo Alto, CA, 1996, pp. 153\u2013169.","DOI":"10.1007\/3-540-63620-X_61"},{"key":"10.1016\/S0022-0000(03)00032-1_BIB22","doi-asserted-by":"crossref","unstructured":"M. Murata, Extended path expressions for XML, in: Proceedings of 20th ACM Symposium on Principles of Database Systems, Santa Barbara, CA, May 2001, pp. 126\u2013137.","DOI":"10.1145\/375551.375569"},{"key":"10.1016\/S0022-0000(03)00032-1_BIB23","unstructured":"F. Neven, T. Schwentick, XML Schemas without Order, Unpublished manuscript, 1999."},{"key":"10.1016\/S0022-0000(03)00032-1_BIB24","series-title":"Computational Complexity","author":"Papadimitriou","year":"1994"},{"key":"10.1016\/S0022-0000(03)00032-1_BIB25","doi-asserted-by":"crossref","unstructured":"Y. Papakonstantinou, V. Vianu, DTD inference for views of XML data, in: Proceedings of the ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, Dallas, TX, 2000, pp. 35\u201346.","DOI":"10.1145\/335168.335173"},{"issue":"2","key":"10.1016\/S0022-0000(03)00032-1_BIB26","first-page":"264","article-title":"On a problem of formal logic","volume":"30","author":"Ramsey","year":"1929","journal-title":"Proc. London Math. Soc."},{"issue":"1","key":"10.1016\/S0022-0000(03)00032-1_BIB27","first-page":"113","article-title":"The complexity of querying infinite data about linearly ordered domains","volume":"54","author":"van der Meyden","year":"1997","journal-title":"JCSS"},{"key":"10.1016\/S0022-0000(03)00032-1_BIB28","doi-asserted-by":"crossref","unstructured":"W. Thomas, Languages, automata, and logic, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, Vol. 3, Springer, Berlin, 1997 (Chapter 7).","DOI":"10.1007\/978-3-642-59126-6_7"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003000321?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003000321?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T08:12:03Z","timestamp":1682496723000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000003000321"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["S0022000003000321"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(03)00032-1","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}