{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:18:50Z","timestamp":1726409930044},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642120251"},{"type":"electronic","value":"9783642120268"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12026-8_20","type":"book-chapter","created":{"date-parts":[[2010,4,7]],"date-time":"2010-04-07T09:56:08Z","timestamp":1270634168000},"page":"250-261","source":"Crossref","is-referenced-by-count":0,"title":["Chasing Tree Patterns under Recursive DTDs"],"prefix":"10.1007","author":[{"given":"Junhu","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey Xu","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Amer-Yahia, S., Cho, S., Lakshmanan, L.V.S., Srivastava, D.: Minimization of tree pattern queries. In: SIGMOD, pp. 497\u2013508 (2001)","DOI":"10.1145\/375663.375730"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Choi, B.: What are real dtds like? In: WebDB, pp. 43\u201348 (2002)","DOI":"10.1023\/A:1022665831622"},{"key":"20_CR3","unstructured":"Lakshmanan, L.V.S., Wang, H., Zhao, Z.J.: Answering tree pattern queries using views. In: VLDB, pp. 571\u2013582 (2006)"},{"key":"20_CR4","unstructured":"Mandhani, B., Suciu, D.: Query caching and view selection for XML databases. In: VLDB, pp.\u00a0469\u2013480 (2005)"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Miklau, G., Suciu, D.: Containment and equivalence for an XPath fragment. In: PODS, pp. 65\u201376 (2002)","DOI":"10.1145\/543613.543623"},{"key":"20_CR6","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"},{"key":"20_CR7","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":"20_CR8","unstructured":"Xu, W., \u00d6zsoyoglu, Z.M.: Rewriting XPath queries using materialized views. In: VLDB, pp. 121\u2013132 (2005)"}],"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-12026-8_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T14:50:43Z","timestamp":1685544643000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12026-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642120251","9783642120268"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12026-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}