Abstract
Discovery of frequent XML query patterns in the history log of XML queries can be used to expedite XML query processing, as the answers to these queries can be cached and reused when the future queries “hit” such frequent patterns. In this paper, we propose an efficient bottom-up mining approach to finding frequent query patterns in XML queries. We merge all queries into a summarizing structure named global tree guide (GTG). We refine GTG by pruning infrequent nodes and clustering adjacent nodes in the queries to obtain a Compressed GTG (known as CGTG). We employ a bottom-up traversal scheme based on CGTG to generate frequent query patterns for each node till the root of CGTG. Experiments show that our proposed method is efficient and outperforms the previous mining algorithms of XML queries, such as XQPMinerTID and FastXMiner.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chen, L., Rundensteiner, E.A., Wang, S.: Xcache-a semantic caching system for xml queries. In: Demo in ACM SIGMOD (2002)
Hristidis, V., Petropoulos, M.: Semantic caching of xml databases. In: Proc. Of the 5th WebDB (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)
Yang, L.H., Lee, M.L., Hsu, W., Acharya, S.: Mining Frequent Query Patterns from XML Queries. In: DASFAA, pp. 355–362 (2003)
Asai, T., Abe, K., Kawasoe, S., Arimura, H., Satamoto, H., Arikawa, S.: Efficient Substructure Discovery from Large Semi-structured Data. In: 2nd SIAM Int’l Conference on Data Mining (2002)
Asai, T., Arimura, H., Uno, T., Nakano, S.: Discovering Frequent Substructures in Large Unordered Trees. In: 6th Int’l Conf. on Discovery Science (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)
Chi, Y., Yang, Y., Muntz, R.R.: Indexing and Mining Free Trees. In: 3rd IEEE International Conference on Data Mining (2003)
Chi, Y., Yang, Y., Muntz, R.R.: HybridTreeMiner: An Efficient Algorihtm for Mining Frequent Rooted Trees and Free Trees Using Canonical Forms. In: 16th International Conference on Scientific and Statistical Database Management (2004)
Luccio, F., Enriquez, A.M., Rieumont, P.O., Pagli, L.: Exact Rooted Subtree Matching in Sublinear Time, Technical Report TR-01-14 (2001)
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). BUXMiner: An Efficient Bottom-Up Approach to Mining XML Query Patterns. In: Dong, G., Lin, X., Wang, W., Yang, Y., Yu, J.X. (eds) Advances in Data and Web Management. APWeb WAIM 2007 2007. Lecture Notes in Computer Science, vol 4505. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72524-4_73
Download citation
DOI: https://doi.org/10.1007/978-3-540-72524-4_73
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72483-4
Online ISBN: 978-3-540-72524-4
eBook Packages: Computer ScienceComputer Science (R0)