Abstract
Common query patterns of multiple XML queries can be stored and shared to accelerate the query execution efficiently. We present a new technique for efficiently mining frequent XML query patterns with DTD cardinality constraints. We first introduce a new definition of extended subtree for XML query patterns (EST), which provides a model for supporting special characters of ”common” XML query pattern. Then we ”push” the DTD cardinality constraints deep into the mining process to prune the search space and still ensure the completeness of the answers. Finally, we propose an algorithm FEST for effectively mining frequent ESTs to improve the query performance for XML data management system.
This work is supported by the NKBRSF of China (973) under grant No.G1999032705, the National ’863’ High-Tech Program of China under grant No. 2002AA4Z3440.
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
Gottlob, G., Koch, C., Pichler, R.: Efficient Algorithms for Processing XPath queries. In: Proceedings of the 28th International Conference on Very Large Data Bases (VLDB 2002), Hong Kong, China, August 20-23 (2002)
Li, Q., Moon, B.: Indexing and Querying XML Data for Regular Path Expressions. In: Proceedings of the 27th International Conference on Very Large Data Bases (VLDB 2001), Rome, Italy, September 2001, pp. 361–370 (2001)
Miklau, G., Suciu, D.: Containment and Equivalence for an XPath Fragment. In: Proceedings of the Twenty-first ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2002 (2002)
Wood, P.T.: Containment for XPath Fragments under DTD Constraints. In: Proceedings of the 9th International Conference on Database Theory, Siena, Italy, January 8-10 (2003)
Amer-Yahia, S., Cho, S., Lakshmanan, L.K.S., Srivastava, D.: Minimization of tree pattern queries. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Santa Barbara, California, USA, May 21-24 (2001)
Zhang, X., Dimitrova, K., et al.: RainbowII: Multi-XQuery Optimization Using Materialized XML Views. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, San Diego, California, USA (2003)
Dimitrova, K., EL-Sayed, M., Rundensteiner, E.: Order-sensitive View Maintenance of Materialized XQuery Views. In: Proceedings of the International Conference on Conceptual Modeling (ER 2003), Chicago, Illinois (2003)
Chidlovskii, B., Borghoff, U.M.: Semantic Caching of Web Queries. VLDB Journal 9(1), 2–17 (2000)
Yang, L.H., Lee, M.L., Hsu, W.: Efficient Mining of XML Query Patterns for Caching. In: Proceedings of the 29th International Conference on Very Large Data Bases (VLDB 2003), Berlin, Germany (2003)
Zaki, M.J.: Efficiently Mining Frequent Trees in a Forest. In: Proceedings of the ACM SIGKDD International Conference, Edmonton, Alberta, Canada (2002)
Lee, D., Chu, W.W.: Constraints-preseving Transformation from XML Document Type Definition to Relational Schema. In: Laender, A.H.F., Liddle, S.W., Storey, V.C. (eds.) ER 2000. LNCS, vol. 1920, Springer, Heidelberg (2000)
Zaki, M.J.: Scalable Algorithms for Association Mining. IEEE Transactions on Knowledge and Data Engineering 12(3), 372–390 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, Y., Yang, D., Tang, S., Wang, T., Gao, J. (2004). Discovery of Frequent XML Query Patterns with DTD Cardinality Constraints. In: Li, Q., Wang, G., Feng, L. (eds) Advances in Web-Age Information Management. WAIM 2004. Lecture Notes in Computer Science, vol 3129. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27772-9_56
Download citation
DOI: https://doi.org/10.1007/978-3-540-27772-9_56
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22418-1
Online ISBN: 978-3-540-27772-9
eBook Packages: Springer Book Archive