{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:05:53Z","timestamp":1742918753456,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642034282"},{"type":"electronic","value":"9783642034299"}],"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-03429-9_16","type":"book-chapter","created":{"date-parts":[[2009,8,28]],"date-time":"2009-08-28T12:12:52Z","timestamp":1251461572000},"page":"236-250","source":"Crossref","is-referenced-by-count":0,"title":["A Rewrite Approach for Pattern Containment"],"prefix":"10.1007","author":[{"given":"Barbara","family":"Kordy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"16_CR1","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":"16_CR2","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)"},{"key":"16_CR3","unstructured":"W3C: XML Path Language (1999), http:\/\/www.w3.org\/TR\/xpath"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1152","DOI":"10.1007\/3-540-44957-4_77","volume-title":"Computational Logic - CL 2000","author":"P.T. Wood","year":"2000","unstructured":"Wood, P.T.: On the Equivalence of XML Patterns. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS, vol.\u00a01861, pp. 1152\u20131166. Springer, Heidelberg (2000)"},{"issue":"1","key":"16_CR5","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":"16_CR6","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1145\/1071610.1071614","volume":"30","author":"G. Gottlob","year":"2005","unstructured":"Gottlob, G., Koch, C., Pichler, R.: Efficient Algorithms for Processing XPath Queries. ACM Trans. Database Syst.\u00a030(2), 444\u2013491 (2005)","journal-title":"ACM Trans. Database Syst."},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Flesca, S., Furfaro, F., Masciari, E.: On the Minimization of XPath Queries. J. ACM\u00a055(1) (2008)","DOI":"10.1145\/1326554.1326556"},{"issue":"4","key":"16_CR8","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. VLDB J.\u00a011(4), 315\u2013331 (2002)","journal-title":"VLDB J."},{"key":"16_CR9","first-page":"61","volume-title":"EDBT 2008: Proceedings of the 11th International Conference on Extending Database Technology","author":"B. Kimelfeld","year":"2008","unstructured":"Kimelfeld, B., Sagiv, Y.: Revisiting Redundancy and Minimization in an XPath Fragment. In: EDBT 2008: Proceedings of the 11th International Conference on Extending Database Technology, pp. 61\u201372. ACM, New York (2008)"},{"key":"16_CR10","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1145\/564691.564726","volume-title":"SIGMOD 2002: Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data","author":"P. Ramanan","year":"2002","unstructured":"Ramanan, P.: Efficient Algorithms for Minimizing Tree Pattern Queries. In: SIGMOD 2002: Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, pp. 299\u2013309. ACM, New York (2002)"},{"key":"16_CR11","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/11916277_32","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"B. Fila","year":"2006","unstructured":"Fila, B., Anantharaman, S.: Automata for Positive Core XPath Queries on Compressed Documents. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS (LNAI), vol.\u00a04246, pp. 467\u2013481. Springer, Heidelberg (2006)"},{"key":"16_CR12","first-page":"141","volume-title":"VLDB 2003","author":"P. Buneman","year":"2003","unstructured":"Buneman, P., Grohe, M., Koch, C.: Path Queries on Compressed XML. In: VLDB 2003, pp. 141\u2013152. Morgan Kaufmann, San Francisco (2003)"},{"key":"16_CR13","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-540-45206-5_13","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"M. Marx","year":"2003","unstructured":"Marx, M.: XPath and Modal Logics of Finite DAG\u2019s. In: Cialdea Mayer, M., Pirri, F. (eds.) TABLEAUX 2003. LNCS (LNAI), vol.\u00a02796, pp. 150\u2013164. Springer, Heidelberg (2003)"},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1109\/LICS.2003.1210058","volume-title":"LICS 2003: Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science","author":"M. Frick","year":"2003","unstructured":"Frick, M., Grohe, M., Koch, C.: Query Evaluation on Compressed Trees (Extended Abstract). In: LICS 2003: Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science, p. 188. IEEE Computer Society, Washington (2003)"},{"issue":"4-5","key":"16_CR15","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1016\/j.is.2008.01.004","volume":"33","author":"G. Busatto","year":"2008","unstructured":"Busatto, G., Lohrey, M., Maneth, S.: Efficient Memory Representation of XML Document Trees. Inf. Syst.\u00a033(4-5), 456\u2013474 (2008)","journal-title":"Inf. Syst."},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/11601524_14","volume-title":"Database Programming Languages","author":"J. Niehren","year":"2005","unstructured":"Niehren, J., Planque, L., Talbot, J.M., Tison, S.: N\u2013ary Queries by Tree Automata. In: Bierman, G., Koch, C. (eds.) DBPL 2005. LNCS, vol.\u00a03774, pp. 217\u2013231. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Recent Trends in Algebraic Development Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03429-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T14:27:06Z","timestamp":1685111226000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03429-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642034282","9783642034299"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03429-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}