{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:09:04Z","timestamp":1725487744518},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540725831"},{"type":"electronic","value":"9783540725848"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72584-8_34","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T13:58:59Z","timestamp":1184594339000},"page":"261-269","source":"Crossref","is-referenced-by-count":0,"title":["Improving XML Querying with Maximal Frequent Query Patterns"],"prefix":"10.1007","author":[{"given":"Yijun","family":"Bei","sequence":"first","affiliation":[]},{"given":"Gang","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Jinxiang","family":"Dong","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","unstructured":"Clark, J., DeRose, S.: XML path language (XPath) version 1.0 w3c recommendation. Technical Report REC-xpath-199991116, World Wide Web Consortium (1999)"},{"key":"34_CR2","unstructured":"Charmberlin, D., Florescu, D., Robie, J., Simon, J., Stefanescu, M.: XQuery: A query language for XML. W3C Working Draft (2001), http:\/\/www.w3.org\/TR\/xquey"},{"key":"34_CR3","unstructured":"Hristidis, V., Petropoulos, M.: Semantic caching of xml databases. In: Proc. Of the 5th WebDB (2002)"},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Chen, L., Rundensteiner, E.A., Wang, S.: Xcache-a semantic caching system for xml queries. In: Demo in ACM SIGMOD (2002)","DOI":"10.1145\/564764.564771"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"Yang, L.H., Lee, M.L., Hsu, W.: Efficient mining of xml query patterns for caching. In: Proc. of 29th VLDB (2003)","DOI":"10.1016\/B978-012722442-8\/50015-X"},{"key":"34_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1007\/11576259","volume-title":"Database Systems for Advanced Applications","author":"L. Chen","year":"2005","unstructured":"Chen, L., Bhowmick, S.S., Chia, L.-T.: Mining Positive and Negative Association Rules from XML Query Patterns for Caching. In: Zhou, L.-z., Ooi, B.-C., Meng, X. (eds.) DASFAA 2005. LNCS, vol.\u00a03453, pp. 736\u2013747. Springer, Heidelberg (2005)"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Asai, T., Abe, K., Kawasoe, S., Arimura, H., Satamoto, H., Arikawa, S.: Efficient Substructure Discovery from Large Semi-structured Data. In: SDM, pp. 158\u2013174 (2002)","DOI":"10.1137\/1.9781611972726.10"},{"key":"34_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/978-3-540-39644-4_6","volume-title":"Discovery Science","author":"T. Asai","year":"2003","unstructured":"Asai, T., Arimura, H., Uno, T., Nakano, S.-i.: Discovering Frequent Substructures in Large Unordered Trees. In: Grieser, G., Tanaka, Y., Yamamoto, A. (eds.) DS 2003. LNCS (LNAI), vol.\u00a02843, pp. 47\u201361. Springer, Heidelberg (2003)"},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"Zaki, M.J.: Efficiently Mining Frequent Trees in a Forest. In: 8th ACM SIGKDD Int\u2019l Conf. Knowledge Discovery and Data Mining (2002)","DOI":"10.1145\/775047.775058"},{"key":"34_CR10","unstructured":"Zaki, M.J.: Efficiently Mining Frequent Embedded Unordered Trees. Fundamenta Informaticae (2005)"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"Al-Khalifa, S., Jagadish, H.V., Koudas, N., Patel, J.M., Srivastava, D., Wu, Y.: Structural Joins: A Primitive for Efficient XML Query Pattern Matching. In: Proceedings of the IEEE International Conference on Data Engineering, pp. 141\u2013152 (2002)","DOI":"10.1109\/ICDE.2002.994704"},{"key":"34_CR12","unstructured":"http:\/\/monetdb.cwi.nl\/xml\/"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2007"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72584-8_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:09:40Z","timestamp":1556669380000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72584-8_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540725831","9783540725848"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72584-8_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}