{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:57:32Z","timestamp":1790816252174,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540852377","type":"print"},{"value":"9783540852384","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85238-4_10","type":"book-chapter","created":{"date-parts":[[2008,8,18]],"date-time":"2008-08-18T15:34:36Z","timestamp":1219073676000},"page":"132-143","source":"Crossref","is-referenced-by-count":32,"title":["Optimizing Conjunctive Queries over Trees Using 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":"10_CR1","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"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Bjorklund, H., Martens, W., Schwentick, T.: Conjunctive query containment over trees. In: DBPL, pp. 66\u201380 (2007)","DOI":"10.1007\/978-3-540-75987-4_5"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Bojanczyk, M., David, C., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data trees and XML reasoning. In: PODS, pp. 10\u201319 (2006)","DOI":"10.1145\/1142351.1142354"},{"issue":"1","key":"10_CR4","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A.K. Chandra","year":"1981","unstructured":"Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. J. ACM\u00a028(1), 114\u2013133 (1981)","journal-title":"J. ACM"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Chandra, A.K., Merlin, P.M.: Optimal implementation of conjunctive queries in relational data bases. In: STOC, pp. 77\u201390 (1977)","DOI":"10.1145\/800105.803397"},{"key":"10_CR6","unstructured":"Clark, J., De Rose, S.: XML Path Language (XPath) version 1.0. Technical report, World Wide Web Consortium (1999), http:\/\/www.w3.org\/TR\/xpath\/"},{"key":"10_CR7","unstructured":"Clark, J., Murata, M.: Relax NG specification (December 2001), http:\/\/www.relaxng.org\/spec-20011203.html"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"David, C.: Complexity of data tree patterns over XML documents. In: MFCS (to appear, 2008)","DOI":"10.1007\/978-3-540-85238-4_22"},{"issue":"1","key":"10_CR9","first-page":"50","volume":"20","author":"J. Gallant","year":"1980","unstructured":"Gallant, J., Maier, D., Storer, J.A.: On finding minimal length superstrings. JCSS\u00a020(1), 50\u201358 (1980)","journal-title":"JCSS"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Geerts, F., Fan, W.: Satisfiability of XPath queries with sibling axes. In: DBPL, pp. 122\u2013137 (2005)","DOI":"10.1007\/11601524_8"},{"issue":"2","key":"10_CR11","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1145\/1131342.1131345","volume":"53","author":"G. Gottlob","year":"2006","unstructured":"Gottlob, G., Koch, C., Schulz, K.U.: Conjunctive queries over trees. J. ACM\u00a053(2), 238\u2013272 (2006)","journal-title":"J. ACM"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Hidders, J.: Satisfiability of XPath expressions. In: DBPL, pp. 21\u201336 (2003)","DOI":"10.1007\/978-3-540-24607-7_3"},{"issue":"2","key":"10_CR13","first-page":"302","volume":"61","author":"P.G. Kolaitis","year":"2000","unstructured":"Kolaitis, P.G., Vardi, M.Y.: Conjunctive query containment and constraint satisfaction. JCSS\u00a061(2), 302\u2013332 (2000)","journal-title":"JCSS"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Lakshmanan, L.V.S., Ramesh, G., Wang, H., Zhao, Z.: On testing satisfiability of tree pattern queries. In: VLDB, pp. 120\u2013131 (2004)","DOI":"10.1016\/B978-012088469-8.50014-0"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Marx, M.: XPath with conditional axis relations. In: EDBT, pp. 477\u2013494 (2004)","DOI":"10.1007\/978-3-540-24741-8_28"},{"issue":"1","key":"10_CR16","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":"10_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"},{"issue":"2","key":"10_CR18","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0304-3975(81)90075-X","volume":"16","author":"K.J. R\u00e4ih\u00e4","year":"1981","unstructured":"R\u00e4ih\u00e4, K.J., Ukkonen, E.: The shortest common supersequence problem over binary alphabet is NP-complete. TCS\u00a016(2), 187\u2013198 (1981)","journal-title":"TCS"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Cate, B.t., Lutz, C.: The complexity of query containment in expressive fragments of XPath 2.0. In: PODS, pp. 73\u201382 (2007)","DOI":"10.1145\/1265530.1265541"},{"key":"#cr-split#-10_CR20.1","doi-asserted-by":"crossref","unstructured":"Wood, P.T.: Containment for XPath fragments under DTD constraints. In: ICDT (2003);","DOI":"10.1007\/3-540-36285-1_20"},{"key":"#cr-split#-10_CR20.2","unstructured":"Full version, obtained through personal communication"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85238-4_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T15:19:03Z","timestamp":1738336743000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85238-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540852377","9783540852384"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85238-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}