Abstract
With XML being the standard for data encoding and exchange over Internet, how to find the interesting XML query characteristic efficiently becomes a critical issue. Mining frequent query pattern is a technique to discover the most frequently occurring query pattern trees from a large collection of XML queries. In this paper, we describe an efficient mining algorithm to discover the frequent query pattern trees from a large collection of XML queries.
Chapter PDF
References
L. H. Yang, M. L. Lee, W. Hsu. Mining Frequent Query Patterns in XML. 8th Int. Conference on Database Systems for Advanced Applications (DASFAA), 2003.
L. H. Yang, M. L. Lee, W. Hsu. Approximate Counting of Frequent Query Patterns over XQuery Stream, (DASFAA), 2004.
Yi, Chen. Discovering Ordered Tree Patterns from XML Queries, PAKDD, 2004.
S. Boag (XSL WG), D. Chamberlin, MF. Fernandez, D. Florescu, J. Robie, and J. Simeon. XQuery 1.0: An XML Query Language, W3C Recommendation 23 January 2007, http://www.w3.org/TR/2007/REC-xquery-0070123/.
P. Fankhauser, M. Fernández, A. Malhotra, etc. The XML Query Algebra, W3C Working Draft 04 December 2000,.
http://www.w3.org/TR/xpath.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 International Federation for Information Processing
About this paper
Cite this paper
Hua, C., Zhao, Hj., Chen, Y. (2007). Mining XML Frequent Query Patterns. In: Wang, W., Li, Y., Duan, Z., Yan, L., Li, H., Yang, X. (eds) Integration and Innovation Orient to E-Society Volume 1. IFIP — The International Federation for Information Processing, vol 251. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-75466-6_4
Download citation
DOI: https://doi.org/10.1007/978-0-387-75466-6_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-75465-9
Online ISBN: 978-0-387-75466-6
eBook Packages: Computer ScienceComputer Science (R0)