{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T21:13:27Z","timestamp":1791148407544,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642403125","type":"print"},{"value":"9783642403132","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40313-2_17","type":"book-chapter","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T10:36:43Z","timestamp":1376649403000},"page":"171-182","source":"Crossref","is-referenced-by-count":11,"title":["Validity of Tree Pattern Queries with Respect to Schema Information"],"prefix":"10.1007","author":[{"given":"Henrik","family":"Bj\u00f6rklund","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wim","family":"Martens","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Schwentick","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"17_CR1","unstructured":"Arenas, M., Daenen, J., Neven, F., Van den Bussche, J., Ugarte, M., Vansummeren, S.: Discovering XSD keys from XML data. In: SIGMOD (to appear, 2013)"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-642-31585-5_11","volume-title":"Automata, Languages, and Programming","author":"M. Benedikt","year":"2012","unstructured":"Benedikt, M., Bourhis, P., Senellart, P.: Monadic datalog containment. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part II. LNCS, vol.\u00a07392, pp. 79\u201391. Springer, Heidelberg (2012)"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Benedikt, M., Fan, W., Geerts, F.: XPath satisfiability in the presence of DTDs. J. ACM\u00a055(2) (2007)","DOI":"10.1145\/1346330.1346333"},{"issue":"4","key":"17_CR4","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1145\/1862919.1862926","volume":"35","author":"H. Bj\u00f6rklund","year":"2010","unstructured":"Bj\u00f6rklund, H., Gelade, W., Martens, W.: Incremental XPath evaluation. ACM Trans. Database Syst.\u00a035(4), 29 (2010)","journal-title":"ACM Trans. Database Syst."},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-540-85238-4_10","volume-title":"Mathematical Foundations of Computer Science 2008","author":"H. Bj\u00f6rklund","year":"2008","unstructured":"Bj\u00f6rklund, H., Martens, W., Schwentick, T.: Optimizing conjunctive queries over trees using schema information. In: Ochma\u0144ski, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol.\u00a05162, pp. 132\u2013143. Springer, Heidelberg (2008)"},{"key":"17_CR6","unstructured":"Bray, T., Paoli, J., Sperberg-McQueen, C.M., Maler, E., Yergeau, F.: Extensible Markup Language XML 1.0 (5th edn.). World Wide Web Consortium (2008)"},{"issue":"3","key":"17_CR7","first-page":"374","volume":"32","author":"B.S. Chlebus","year":"1986","unstructured":"Chlebus, B.S.: Domino-tiling games. JCSS\u00a032(3), 374\u2013392 (1986)","journal-title":"JCSS"},{"key":"17_CR8","unstructured":"Clark, J., DeRose, S.: XML Path Language (XPath) version 1.0. Technical report, World Wide Web Consortium (1999), \n                  \n                    http:\/\/www.w3.org\/TR\/xpath\/"},{"key":"17_CR9","unstructured":"Clark, J., Murata, M.: Relax NG specification (2001), \n                  \n                    http:\/\/www.relaxng.org"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Flesca, S., Furfaro, F., Masciari, E.: On the minimization of XPath queries. J. ACM\u00a055(1) (2008)","DOI":"10.1145\/1326554.1326556"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Gelade, W., Idziaszek, T., Martens, W., Neven, F.: Simplifying XML Schema: Single-type approximations of regular tree languages. In: PODS (2010)","DOI":"10.1145\/1807085.1807118"},{"key":"17_CR12","unstructured":"Hashimoto, K., Kusunoki, Y., Ishihara, Y., Fujiwara, T.: Validity of positive XPath queries with wildcard in the presence of DTDs. In: DBPL (2011)"},{"issue":"3","key":"17_CR13","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1145\/1324185.1324188","volume":"36","author":"W. Martens","year":"2007","unstructured":"Martens, W., Neven, F., Schwentick, T.: Simple off the shelf abstractions for XML Schema. SIGMOD Record\u00a036(3), 15\u201322 (2007)","journal-title":"SIGMOD Record"},{"issue":"3","key":"17_CR14","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., Bex, G.J.: Expressiveness and complexity of XML Schema. ACM Trans. Database Syst.\u00a031(3), 770\u2013813 (2006)","journal-title":"ACM Trans. Database Syst."},{"issue":"1","key":"17_CR15","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/962446.962448","volume":"51","author":"G. Miklau","year":"2004","unstructured":"Miklau, G., Suciu, D.: Containment and equivalence for a fragment of XPath. J. ACM\u00a051(1), 2\u201345 (2004)","journal-title":"J. ACM"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1007\/978-3-642-32589-2_61","volume-title":"Mathematical Foundations of Computer Science 2012","author":"F. Murlak","year":"2012","unstructured":"Murlak, F., Ogi\u0144ski, M., Przyby\u0142ko, M.: Between tree patterns and conjunctive queries: Is there tractability beyond acyclicity? In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol.\u00a07464, pp. 705\u2013717. Springer, Heidelberg (2012)"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Neven, F., Schwentick, T.: On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. LMCS\u00a02(3) (2006)","DOI":"10.2168\/LMCS-2(3:1)2006"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Stockmeyer, L., Meyer, A.: Word problems requiring exponential time: Preliminary report. In: STOC, pp. 1\u20139 (1973)","DOI":"10.1145\/800125.804029"},{"key":"17_CR19","unstructured":"Thompson, H.S., Mendelsohn, N., Beech, D., Maloney, M.: XML Schema Definition Language (XSD) 1.1, \n                  \n                    http:\/\/www.w3.org\/TR\/xmlschema11-1\/"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40313-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T14:13:38Z","timestamp":1558016018000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40313-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642403125","9783642403132"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40313-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}