{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T09:44:32Z","timestamp":1725529472746},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642008863"},{"type":"electronic","value":"9783642008870"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00887-0_36","type":"book-chapter","created":{"date-parts":[[2009,3,19]],"date-time":"2009-03-19T13:49:36Z","timestamp":1237470576000},"page":"405-420","source":"Crossref","is-referenced-by-count":2,"title":["Containment between Unions of XPath Queries"],"prefix":"10.1007","author":[{"given":"Rui","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengfei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junhu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianxin","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"36_CR1","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1137\/0208017","volume":"8","author":"A.V. Aho","year":"1979","unstructured":"Aho, A.V., Sagiv, Y., Ullman, J.D.: Equivalences among relational expressions. SIAM J. Comput.\u00a08(2), 218\u2013246 (1979)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"36_CR2","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/s007780100054","volume":"10","author":"A.Y. Halevy","year":"2001","unstructured":"Halevy, A.Y.: Answering queries using views: A survey. VLDB J.\u00a010(4), 270\u2013294 (2001)","journal-title":"VLDB J."},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"Gupta, A., Sagiv, Y., Ullman, J.D., Widom, J.: Constraint checking with partial information. In: PODS, pp. 45\u201355 (1994)","DOI":"10.1145\/182591.182597"},{"key":"36_CR4","unstructured":"Levy, A.Y., Sagiv, Y.: Queries independent of updates. In: VLDB, pp. 171\u2013181 (1993)"},{"key":"36_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"},{"issue":"4","key":"36_CR6","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1145\/322217.322221","volume":"27","author":"Y. Sagiv","year":"1980","unstructured":"Sagiv, Y., Yannakakis, M.: Equivalences among relational expressions with the union and difference operators. J. ACM\u00a027(4), 633\u2013655 (1980)","journal-title":"J. ACM"},{"key":"36_CR7","unstructured":"Clark, J., DeRose, S.: XML path language (XPath) 1.0. In: W3C Recommendation (November 1999), http:\/\/www.w3.org\/TR\/xpath"},{"issue":"1","key":"36_CR8","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":"36_CR9","series-title":"Lecture Notes in Computer Science","first-page":"297","volume-title":"Database Theory - ICDT 2003","author":"P.T. Wood","year":"2002","unstructured":"Wood, P.T.: Containment for xPath fragments under DTD constraints. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol.\u00a02572, pp. 297\u2013311. Springer, Heidelberg (2002)"},{"key":"36_CR10","series-title":"Lecture Notes in Computer Science","first-page":"312","volume-title":"Database Theory - ICDT 2003","author":"F. Neven","year":"2002","unstructured":"Neven, F., Schwentick, T.: XPath containment in the presence of disjunction, dTDs, and variables. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol.\u00a02572, pp. 312\u2013326. Springer, Heidelberg (2002)"},{"issue":"1","key":"36_CR11","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1145\/974121.974140","volume":"33","author":"T. Schwentick","year":"2004","unstructured":"Schwentick, T.: Xpath query containment. SIGMOD Rec.\u00a033(1), 101\u2013109 (2004)","journal-title":"SIGMOD Rec."},{"issue":"2","key":"36_CR12","first-page":"183","volume":"2","author":"P. Wadler","year":"2000","unstructured":"Wadler, P.: A formal semantics of patterns in xslt and xpath. Markup Lang.\u00a02(2), 183\u2013202 (2000)","journal-title":"Markup Lang."},{"issue":"4","key":"36_CR13","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s00778-002-0076-7","volume":"11","author":"S. Amer-Yahia","year":"2002","unstructured":"Amer-Yahia, S., Cho, S., Lakshmanan, L.V.S., Srivastava, D.: Tree pattern query minimization. The VLDB Journal\u00a011(4), 315\u2013331 (2002)","journal-title":"The VLDB Journal"},{"key":"36_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-76993-4_1","volume-title":"Web Information Systems Engineering \u2013 WISE 2007","author":"J. Wang","year":"2007","unstructured":"Wang, J., Yu, J.X., Liu, C.: On tree pattern query rewriting using views. In: Benatallah, B., Casati, F., Georgakopoulos, D., Bartolini, C., Sadiq, W., Godart, C. (eds.) WISE 2007. LNCS, vol.\u00a04831, pp. 1\u201312. Springer, Heidelberg (2007)"},{"key":"36_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-540-85481-4_31","volume-title":"Web Information Systems Engineering - WISE 2008","author":"J. Wang","year":"2008","unstructured":"Wang, J., Yu, J.X., Liu, C.: Contained rewritings of xPath queries using views revisited. In: Bailey, J., Maier, D., Schewe, K.-D., Thalheim, B., Wang, X.S. (eds.) WISE 2008. LNCS, vol.\u00a05175, pp. 410\u2013425. Springer, Heidelberg (2008)"},{"key":"36_CR16","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"},{"issue":"3","key":"36_CR17","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/211414.211419","volume":"20","author":"Y.E. Ioannidis","year":"1995","unstructured":"Ioannidis, Y.E., Ramakrishnan, R.: Containment of conjunctive queries: beyond relations as sets. ACM Trans. Database Syst.\u00a020(3), 288\u2013324 (1995)","journal-title":"ACM Trans. Database Syst."},{"key":"36_CR18","doi-asserted-by":"crossref","unstructured":"ten Cate, B., 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"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00887-0_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T23:36:51Z","timestamp":1558222611000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00887-0_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642008863","9783642008870"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00887-0_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}