{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:44:52Z","timestamp":1725543892376},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540333371"},{"type":"electronic","value":"9783540333388"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11733836_32","type":"book-chapter","created":{"date-parts":[[2006,3,10]],"date-time":"2006-03-10T13:14:31Z","timestamp":1141996471000},"page":"454-467","source":"Crossref","is-referenced-by-count":3,"title":["Hidden Conditioned Homomorphism for XPath Fragment Containment"],"prefix":"10.1007","author":[{"given":"Yuguo","family":"Liao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianhua","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lizhu","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"Amer-Yahia, S., Cho, S., Lakshmanan, L.V.S., Srivastava, D.: Minimi-zation of tree pattern queries. In: Proc of the 2001 ACM SIGMOD Conf. on Management of Data (2001)","DOI":"10.1145\/375663.375730"},{"issue":"4","key":"32_CR2","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., Laksshmanan, L.V.S., Srivastava, D.: Tree pattern query minimization. The VLDB Journal\u00a011(4), 315\u2013331 (2002)","journal-title":"The VLDB Journal"},{"key":"32_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"Database Theory - ICDT 2003","author":"M. Benedikt","year":"2002","unstructured":"Benedikt, M., Fan, W., Kuper, G.M.: Structural properties of XPath fragments. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol.\u00a02572, Springer, Heidelberg (2002)"},{"key":"32_CR4","unstructured":"Boag, S., Chamberlin, D., Fern\u00e1ndez, M.F., Florescu, D., Robie, J., Sim\u00e9on, J.: XQuery 1.0: An XML Query Language, http:\/\/www.w3.org\/TR\/xquery.W3CWorkingdraft"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Buneman, P., Davidson, S., Fan, W., Hara, C., Tan, W.: Reasoning about keys for xml (2000)","DOI":"10.1145\/371920.371984"},{"key":"32_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/3-540-36285-1_22","volume-title":"Database Theory - ICDT 2003","author":"D. Calvanese","year":"2002","unstructured":"Calvanese, D., DeGiacomo, G., Vadi, M.: Decidable containment of recursive queries. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol.\u00a02572, pp. 330\u2013345. Springer, Heidelberg (2002)"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Chandra, A., Merlin, P.: Optimal implementation of conjunctive queries in relational data bases. In: Proceedings of 9th ACM Symposium on Theory of Computing, pp. 77\u201390 (1977)","DOI":"10.1145\/800105.803397"},{"key":"32_CR8","unstructured":"Clark, J.: XSL Transformations (XSLT), http:\/\/www.w3.org\/TR\/xslt.W3CWorkingdraft"},{"key":"32_CR9","unstructured":"Clark, J., DeRose, S.: XML Path Language (XPath) Version 1.0. W3C Working draft, http:\/\/www.w3.org\/TR\/xpath"},{"key":"32_CR10","unstructured":"DeRose, S., Maler, E., Orchard, D.: XML Linking Language (XLink) Version 1.0. W3C Working draft, http:\/\/www.w3.org\/TR\/xpath"},{"key":"32_CR11","unstructured":"DeRose, S., Jr., R.D., Grosso, P., Maler, E., Marsh, J., Walsh, N.: XML Pointer Language (XPointer). W3C Working draft, http:\/\/www.w3.org\/TR\/xptr"},{"issue":"1","key":"32_CR12","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":"32_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/3-540-49257-7_18","volume-title":"Database Theory - ICDT\u201999","author":"T. Milo","year":"1998","unstructured":"Milo, T., Suciu, D.: Index structures for path expressions. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol.\u00a01540, pp. 277\u2013295. Springer, Heidelberg (1998)"},{"issue":"3","key":"32_CR14","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/601858.601869","volume":"31","author":"F. Neven","year":"2002","unstructured":"Neven, F.: Automata Theory for XML researchers. SIGMOD Record\u00a031(3), 39\u201346 (2002)","journal-title":"SIGMOD Record"},{"key":"32_CR15","doi-asserted-by":"crossref","unstructured":"Neven, F.,, T.: XPath containment in the presence of disjunction, DTDs, and variables. In: Proc. 9th Int. Conf. on Database Theory (ICDT), Siena, pp. 315\u2013329 (2003)","DOI":"10.1007\/3-540-36285-1_21"},{"key":"32_CR16","doi-asserted-by":"crossref","unstructured":"Schwentick, T.: XPath query containment. ACM SIGMOD Database priciples Column (2004)","DOI":"10.1145\/974121.974140"},{"issue":"3","key":"32_CR17","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0743-1066(93)90040-N","volume":"15","author":"O. Shmueli","year":"1993","unstructured":"Shmueli, O.: Equivalence of datalog queries is undecidable. The Journal of Logic Programming\u00a015(3), 231\u2013242 (1993)","journal-title":"The Journal of Logic Programming"},{"key":"32_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/3-540-36285-1_20","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. 300\u2013314. Springer, Heidelberg (2002)"},{"key":"32_CR19","unstructured":"Wood, P.T.: Minimizing simple xpath expressions. In: Fourth International Workshop on the Web and Databases (WebDB 2001) (2001)"},{"key":"32_CR20","doi-asserted-by":"crossref","unstructured":"Wood, P.T.: On the equivalence of xml patterns. In: International Conference on Deductive and Object-Oriented Databases (DOOD), pp. 1152\u20131166 (2000)","DOI":"10.1007\/3-540-44957-4_77"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11733836_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T08:07:37Z","timestamp":1555488457000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11733836_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540333371","9783540333388"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11733836_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}