{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T03:05:15Z","timestamp":1794366315413,"version":"4.9.0"},"publisher-location":"Boston, MA","reference-count":26,"publisher":"Springer US","isbn-type":[{"value":"9780387355443","type":"print"},{"value":"9780387399409","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","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-0-387-39940-9_797","type":"book-chapter","created":{"date-parts":[[2009,9,16]],"date-time":"2009-09-16T04:53:09Z","timestamp":1253076789000},"page":"3637-3640","source":"Crossref","is-referenced-by-count":2,"title":["XML Tree Pattern, XML Twig Query"],"prefix":"10.1007","author":[{"given":"Laks V. S.","family":"Lakshmanan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"797_CR1_797","doi-asserted-by":"crossref","unstructured":"Al-Khalifa S., Jagadish H.V., Koudas N., Patel J.M., Srivastava D., and Wu Y. Structural joins: a primitive for efficient XML query pattern matching. In Proc. 18th Int. Conf. on Data Engineering, 2002, pp. 141\u2013152.","DOI":"10.1109\/ICDE.2002.994704"},{"key":"797_CR2_797","doi-asserted-by":"crossref","unstructured":"Amer-Yahia S., Cho S.R., Lakshmanan L.V.S., and Srivastava D. Minimization of tree pattern queries. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 2001, pp. 497\u2013508.","DOI":"10.1145\/375663.375730"},{"key":"797_CR3_797","doi-asserted-by":"crossref","unstructured":"Amer-Yahia S., Cho S.R., and Srivastava D. Tree pattern relaxation. In Advances in Database Technology, Proc. 8th Int. Conf. on Extending Database Technology, 2002, pp. 496\u2013513.","DOI":"10.1007\/3-540-45876-X_32"},{"key":"797_CR4_797","doi-asserted-by":"crossref","unstructured":"Amer-Yahia S., Lakshmanan L.V.S., and Pandit S. FleXPath: flexible structure and full-text querying for XML. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 2004, pp. 83\u201394.","DOI":"10.1145\/1007568.1007581"},{"key":"797_CR5_797","doi-asserted-by":"crossref","unstructured":"Benedikt M., Fan W., and Geerts F. XPath satisfiability in the presence of DTDs. In Proc. 24th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, 2005, pp. 25\u201336.","DOI":"10.1145\/1065167.1065172"},{"key":"797_CR6_797","doi-asserted-by":"crossref","unstructured":"Benedikt M., Fan W., and Kuper G.M. Structural properties of XPath fragments. In Proc. 9th Int. Conf. on Database Theory, 2003, pp. 79\u201395.","DOI":"10.1007\/3-540-36285-1_6"},{"key":"797_CR7_797","doi-asserted-by":"crossref","unstructured":"Bruno N., Koudas N., and Srivastava D. Holistic twig joins: optimal XML pattern matching. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 2002, pp. 310\u2013321.","DOI":"10.1145\/564691.564727"},{"key":"797_CR8_797","unstructured":"Chen Z., Jagadish H.V., Korn F., Koudas N., Muthukrishnan S., Ng R., and Srivastava D. Counting twig matches in a tree. In Proc. 17th Int. Conf. on Data Engineering, 2001, pp. 595\u2013604."},{"key":"797_CR9_797","doi-asserted-by":"crossref","unstructured":"Chien S.Y., Vagena Z., Zhang D., Tsotras V.J., and Zaniolo C. Efficient structural joins on indexed XML documents. In Proc. 28th Int. Conf. on Very Large Data Bases, 2002, pp. 263\u2013274.","DOI":"10.1016\/B978-155860869-6\/50031-7"},{"key":"797_CR10_797","doi-asserted-by":"crossref","unstructured":"Deutsch A. and Tannen V. Reformulation of XML queries and constraints. In Proc. 9th Int. Conf. on Database Theory, 2003, pp. 225\u2013241.","DOI":"10.1007\/3-540-36285-1_15"},{"key":"797_CR11_797","doi-asserted-by":"crossref","unstructured":"Flesca S., Furfaro F., and Masciari E. On the minimization of Xpath queries. In Proc. 29th Int. Conf. on Very Large Data Bases, 2003, pp. 153\u2013164.","DOI":"10.1016\/B978-012722442-8\/50022-7"},{"key":"797_CR12_797","doi-asserted-by":"crossref","unstructured":"Freire J., Haritsa J., Ramanath M., Roy P., and Simeon J. StatiX: making XML count. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 2002, pp. 181\u2013191.","DOI":"10.1145\/564691.564713"},{"key":"797_CR13_797","doi-asserted-by":"crossref","unstructured":"Gokhale C., Gupta N., Kumar P., Lakshmanan L.V.S., Ng R., and Prakash B.A. Complex group-by queries for XML. In Proc. 23rd Int. Conf. on Data Engineering, 2007, pp. 646\u2013655.","DOI":"10.1109\/ICDE.2007.367910"},{"key":"797_CR14_797","doi-asserted-by":"crossref","unstructured":"Hidders J. Satisfiability of XPath expressions. In Proc. 9th Int. Workshop on Database Programming Languages, 2003, pp. 21\u201336.","DOI":"10.1007\/978-3-540-24607-7_3"},{"key":"797_CR15_797","doi-asserted-by":"crossref","unstructured":"Jagadish H.V., Lakshmanan L.V.S., Srivastava D., and Thompson K. TAX: a tree algebra for XML. In Proc. 8th Int. Workshop on Database Programming Languages, 2001, pp. 149\u2013169.","DOI":"10.1007\/3-540-46093-4_9"},{"issue":"4","key":"797_CR16_797","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/s00778-002-0081-x","volume":"11","author":"H.V. Jagadish","year":"2002","unstructured":"Jagadish H.V., Al-Khalifa S., Chapman A., Lakshmanan L.V.S., Nierman A., Paparizos S., Patel J.M., Srivastava D., Wiwatwattana N., Wu Y., and Yu C.TIMBER: a native XML database. VLDB J., 11(4):274\u2013291, 2002.","journal-title":"VLDB J."},{"key":"797_CR17_797","unstructured":"Jiang H., Lu H., Wang W., and Ooi B.C. XR-tree: indexing XML data for efficient structural joins. In Proc. 19th Int. Conf. on Data Engineering, 2003, pp. 253\u2013263."},{"key":"797_CR18_797","doi-asserted-by":"crossref","unstructured":"Lakshmanan L.V.S., Ramesh G., Wang H., and (Jessica) Zhao Z. On testing satisfiability of tree pattern queries. In Proc. 30th Int. Conf. on Very Large Data Bases, 2004, pp. 120\u2013131.","DOI":"10.1016\/B978-012088469-8.50014-0"},{"key":"797_CR19_797","unstructured":"Lakshmanan L.V.S., Wang H., and (Jessica) Zhao Z. Answering tree pattern queries using views. In Proc. 32nd Int. Conf. on Very Large Data Bases, 2006, pp. 571\u2013582."},{"key":"797_CR20_797","doi-asserted-by":"crossref","unstructured":"Miklau G. and Suciu D. Containment and equivalence for a fragment of XPath. In Proc. 21st ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, 2002, pp. 65\u201376.","DOI":"10.1145\/543613.543623"},{"key":"797_CR21_797","doi-asserted-by":"crossref","unstructured":"Paparizos S., Al-Khalifa S., Jagadish H.V., Lakshmanan L.V.S., Nierman A., Srivastava D., and Wu Y. Grouping in XML. In 2002, EDBT 2002 Workshop on XML-Based Data Management LNCS, vol. 2490, Springer, Berlin, pp. 128\u2013147.","DOI":"10.1007\/3-540-36128-6_8"},{"key":"797_CR22_797","doi-asserted-by":"crossref","unstructured":"Polyzotis N. and Garofalakis M. XSketch synopses for XML data graphs. ACM Trans. Database Syst., September 2006.","DOI":"10.1145\/1166074.1166082"},{"key":"797_CR23_797","doi-asserted-by":"crossref","unstructured":"Polyzotis N., Garofalakis M., and Ioannidis Y. Selectivity estimation for XML twigs. In Proc. 20th Int. Conf. on Data Engineering, 2004, pp. 264\u2013275.","DOI":"10.1109\/ICDE.2004.1320003"},{"key":"797_CR24_797","doi-asserted-by":"crossref","unstructured":"Wiwatwattana N., Jagadish H.V., Lakshmanan L.V.S., and Srivastava D. X3: a cube operator for XML OLAP. In Proc. 23rd Int. Conf. on Data Engineering, 2007, pp. 916\u2013925.","DOI":"10.1109\/ICDE.2007.367937"},{"key":"797_CR25_797","unstructured":"XML Path Language (XPath) Version 1.0. http:\/\/www.w3.org\/TR\/xpath."},{"key":"797_CR26_797","unstructured":"Xu W. and Meral \u00d6zsoyoglu Z. Rewriting XPath queries using materialized views. In Proc. 31st Int. Conf. on Very Large Data Bases, 2005, pp. 121\u2013132."}],"container-title":["Encyclopedia of Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-39940-9_797","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,14]],"date-time":"2026-10-14T14:53:39Z","timestamp":1791989619000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-39940-9_797"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9780387355443","9780387399409"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-39940-9_797","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-0-387-39940-9","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2009]]}}}