Abstract
As XML becomes prevailing on the Internet, efficient management of XML queries becomes more important. Caching frequent queries can expedite XML query processing. In this paper, we propose a framework to address an NP-hard optimization problem, caching frequent query patterns. We develop several algorithms to respectively generate query subpatterns, check query containment, and choose query subpatterns for caching. Experimental results show that our algorithms are efficient and scalable.
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
W3C. XQuery 1.0: An XML Query Language (April 2005)
Chen, L., Rundensteiner, E.A.: A Fine-Grained Replacement Strategy for XML Query Cache. In: WIDW, MeLean, Virginia (2002)
Chen, L., Rundensteiner, E.A.: ACE-XQ: A CachE-aware XQuery Answering System. In: Proc. of WebDB, Madison, WI, pp. 31–36 (2002)
Dar, S., Franklin, M.J., Jonsson, B.: Semantic Data Caching and Replacement. In: VLDB, Bombay, India, pp. 330–341 (1996)
Haas, L.M., Kossmann, D., Ursu, I.: Loading a Cache with Query Results. In: Proceedings of the 25th VLDB Conference, Edinburgh, Scotland (1999)
Chidlovskii, B., Broghoff, U.M.: Semantic Caching of Web Queries. VLDB Journal 9(1), 2–12 (2000)
Wu, Y., Patel, J.M., Jagadish, H.V.: Estimating Answer Sizes for XML Queries. In: Jensen, C.S., Jeffery, K., Pokorný, J., Šaltenis, S., Bertino, E., Böhm, K., Jarke, M. (eds.) EDBT 2002. LNCS, vol. 2287, p. 590. Springer, Heidelberg (2002)
Miklau, G., Suciu, D.: Containment and Equivalence for an XPath Fragment. In: Proc. of the 21st ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems (PODS), Madison, Wisconsin, USA, June 3-5 (2002)
Flesca, S., Furfaro, F., Masciari, E.: On the minimization of XPath queries. In: VLDB, Berlin, Germany (2003)
W3C. XPath 1.0: XML Path Language (November 1999), http://www.w3.org/TR/xpath
Dehaspe, L., Toivonen, H., King, R.D.: Finding Frequent Substructures in Chemical Compounds. In: Proc. of ACM SIGKDD, pp. 30–36 (1998)
Kuramochi, M., Karypis, G.: Frequent Subgrapf Discovery. In: IEEE Int. Conference on Data Mining, pp. 313–320 (2001)
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: VLDB (September 1994)
Zaki, M.: Efficiently Mining Frequent Trees in a Forest. In: ACM SIGMOD (2002)
Yang, L.N., Lee, M.L., Hsu, W.: Efficient Mining of XML Query Patterns for Caching. In: VLDB, Berlin, Germany (2003)
Jagadish, H.V., Lakshmanan, L.V.S., Milo, T., Srivastava, D., Vista, D.: Querying network directories. In: Proceedings of the ACM SIGMOD Conference on Management of Data, Philadelphia, PA (June 1999)
Beoder, A.: On the Resemblance and Containment of Documents. In: IEEE SEQUENCES 1997, pp. 21–29 (1998)
Chen, Z., Korn, F., Koudas, N., Muthukrishnan, S., Ng, R.T., Srivastava, D.: Counting Twig Matches in a Tree. In: ICDE (2001)
Yannakakis, M.: Algorithm for acyclic database scheme. In: Zaniolo, Delovel (eds.) VLDB, Los Altos CA. Morgan Kaufman pubs., San Francisco (1981)
Amer-Yahia, S., Choo, S., Lakshmanan, L.V.S., Srivastava, D.: Minimization of tree pattern queries. In: SIGMOD (2001)
Milo, T., Suciu, D.: Index structures for path expressions. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 277–295. Springer, Heidelberg (1998)
Appromixation Algorithms. Springer, Heidelberg (2001)
DBLP data set, Available at: http://www.informatik.uni-trier.de/ley/db/index.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhan, X., Li, J., Wang, H., He, Z. (2006). Caching Frequent XML Query Patterns. In: Shen, H.T., Li, J., Li, M., Ni, J., Wang, W. (eds) Advanced Web and Network Technologies, and Applications. APWeb 2006. Lecture Notes in Computer Science, vol 3842. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11610496_8
Download citation
DOI: https://doi.org/10.1007/11610496_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31158-4
Online ISBN: 978-3-540-32435-5
eBook Packages: Computer ScienceComputer Science (R0)