Abstract
Querying on XML data is a computational-expensive process due to the complex nature of both the XML data and the query. In this paper, we propose an approach to expedite XML query processing by caching the results of a specific class of queries, namely the maximal frequent queries. We mine the maximal frequent query patterns from user-issued queries and cache the results of such queries. We propose a recursive algorithm for query processing using the cached query results. Query rewriting is employed to deal with four kinds of similar queries namely exact matching, exact containment, semantic matching and semantic containment. We perform experiments on the XMARK datasets and show that the proposed methods are both effective and efficient in improving the performance of XML queries.
Chapter PDF
Similar content being viewed by others
References
Clark, J., DeRose, S.: XML path language (XPath) version 1.0 w3c recommendation. Technical Report REC-xpath-199991116, World Wide Web Consortium (1999)
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
Hristidis, V., Petropoulos, M.: Semantic caching of xml databases. In: Proc. Of the 5th WebDB (2002)
Chen, L., Rundensteiner, E.A., Wang, S.: Xcache-a semantic caching system for xml queries. In: Demo in ACM SIGMOD (2002)
Yang, L.H., Lee, M.L., Hsu, W.: Efficient mining of xml query patterns for caching. In: Proc. of 29th VLDB (2003)
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. 3453, pp. 736–747. Springer, Heidelberg (2005)
Asai, T., Abe, K., Kawasoe, S., Arimura, H., Satamoto, H., Arikawa, S.: Efficient Substructure Discovery from Large Semi-structured Data. In: SDM, pp. 158–174 (2002)
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. 2843, pp. 47–61. Springer, Heidelberg (2003)
Zaki, M.J.: Efficiently Mining Frequent Trees in a Forest. In: 8th ACM SIGKDD Int’l Conf. Knowledge Discovery and Data Mining (2002)
Zaki, M.J.: Efficiently Mining Frequent Embedded Unordered Trees. Fundamenta Informaticae (2005)
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–152 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Bei, Y., Chen, G., Dong, J. (2007). Improving XML Querying with Maximal Frequent Query Patterns. In: Shi, Y., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds) Computational Science – ICCS 2007. ICCS 2007. Lecture Notes in Computer Science, vol 4487. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72584-8_34
Download citation
DOI: https://doi.org/10.1007/978-3-540-72584-8_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72583-1
Online ISBN: 978-3-540-72584-8
eBook Packages: Computer ScienceComputer Science (R0)