{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:21:05Z","timestamp":1725492065415},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540759867"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75987-4_5","type":"book-chapter","created":{"date-parts":[[2007,10,4]],"date-time":"2007-10-04T13:29:16Z","timestamp":1191504556000},"page":"66-80","source":"Crossref","is-referenced-by-count":11,"title":["Conjunctive Query Containment over Trees"],"prefix":"10.1007","author":[{"given":"Henrik","family":"Bj\u00f6rklund","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wim","family":"Martens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Schwentick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Berglund, A., Boag, S., Chamberlin, D., Fern\u00e1ndez, M.F., Kay, M., Robie, J., Sim\u00e9on, J.: XML Path Language (XPath) 2.0. Technical report, World Wide Web Consortium (January 2007), http:\/\/www.w3.org\/TR\/xpath20\/"},{"key":"5_CR2","unstructured":"Boag, S., Chamberlin, D., Fern\u00e1ndez, M.F., Florescu, D., Robie, J., Sim\u00e9on, J.: Xquery 1.0: An XML query language. Technical report, World Wide Web Consortium (January 2007), http:\/\/www.w3.org\/TR\/xquery\/"},{"issue":"4","key":"5_CR3","doi-asserted-by":"publisher","first-page":"1371","DOI":"10.1137\/S0097539794262446","volume":"29","author":"E.P.F. Chan","year":"2000","unstructured":"Chan, E.P.F., van der Meyden, R.: Containment and optimization of object-preserving conjunctive queries. Siam J. on Computing\u00a029(4), 1371\u20131400 (2000)","journal-title":"Siam J. on Computing"},{"key":"5_CR4","unstructured":"Clark, J., DeRose, S.: XML Path Language (XPath) version 1.0. Technical report, World Wide Web Consortium (1999), http:\/\/www.w3.org\/TR\/xpath\/"},{"issue":"1","key":"5_CR5","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"},{"issue":"2","key":"5_CR6","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1145\/1059513.1059520","volume":"52","author":"G. Gottlob","year":"2005","unstructured":"Gottlob, G., Koch, C., Pichler, R., Segoufin, L.: The complexity of XPath query evaluation and XML typing. Journal of the ACM\u00a052(2), 284\u2013335 (2005)","journal-title":"Journal of the ACM"},{"issue":"2","key":"5_CR7","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. Journal of the ACM\u00a053(2), 238\u2013272 (2006)","journal-title":"Journal of the ACM"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/978-3-540-24607-7_3","volume-title":"Database Programming Languages","author":"J. Hidders","year":"2004","unstructured":"Hidders, J.: Satisfiability of XPath expressions. In: Lausen, G., Suciu, D. (eds.) DBPL 2003. LNCS, vol.\u00a02921, pp. 21\u201336. Springer, Heidelberg (2004)"},{"issue":"2","key":"5_CR9","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"},{"issue":"1","key":"5_CR10","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. Journal of the ACM\u00a051(1), 2\u201345 (2004)","journal-title":"Journal of the ACM"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Neven, F., Schwentick, T.: On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. Logical Methods in Computer Science\u00a02(3) (2006)","DOI":"10.2168\/LMCS-2(3:1)2006"},{"issue":"2","key":"5_CR12","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":"5_CR13","doi-asserted-by":"crossref","unstructured":"ten Cate, B., Lutz, C.: The complexity of query containment in expressive fragments of XPath 2.0. In: PODS 2007. 26th International Symposium on Principles of Database Systems, pp. 73\u201382 (2007)","DOI":"10.1145\/1265530.1265541"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Vansummeren, S.: On deciding well-definedness for query languages on trees. Journal of the ACM\u00a054(4) (2007)","DOI":"10.1145\/1255443.1255447"}],"container-title":["Lecture Notes in Computer Science","Database Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75987-4_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:38:44Z","timestamp":1619519924000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75987-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540759867"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75987-4_5","relation":{},"subject":[]}}