Caching Frequent XML Query Patterns

  • Xin Zhan
  • Jianzhong Li
  • Hongzhi Wang
  • Zhenying He
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3842)


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.


User Query Query Pattern Cache System Frequent Query Query Pattern Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    W3C. XQuery 1.0: An XML Query Language (April 2005)Google Scholar
  2. 2.
    Chen, L., Rundensteiner, E.A.: A Fine-Grained Replacement Strategy for XML Query Cache. In: WIDW, MeLean, Virginia (2002)Google Scholar
  3. 3.
    Chen, L., Rundensteiner, E.A.: ACE-XQ: A CachE-aware XQuery Answering System. In: Proc. of WebDB, Madison, WI, pp. 31–36 (2002)Google Scholar
  4. 4.
    Dar, S., Franklin, M.J., Jonsson, B.: Semantic Data Caching and Replacement. In: VLDB, Bombay, India, pp. 330–341 (1996)Google Scholar
  5. 5.
    Haas, L.M., Kossmann, D., Ursu, I.: Loading a Cache with Query Results. In: Proceedings of the 25th VLDB Conference, Edinburgh, Scotland (1999)Google Scholar
  6. 6.
    Chidlovskii, B., Broghoff, U.M.: Semantic Caching of Web Queries. VLDB Journal 9(1), 2–12 (2000)CrossRefGoogle Scholar
  7. 7.
    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)CrossRefGoogle Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    Flesca, S., Furfaro, F., Masciari, E.: On the minimization of XPath queries. In: VLDB, Berlin, Germany (2003)Google Scholar
  10. 10.
    W3C. XPath 1.0: XML Path Language (November 1999),
  11. 11.
    Dehaspe, L., Toivonen, H., King, R.D.: Finding Frequent Substructures in Chemical Compounds. In: Proc. of ACM SIGKDD, pp. 30–36 (1998)Google Scholar
  12. 12.
    Kuramochi, M., Karypis, G.: Frequent Subgrapf Discovery. In: IEEE Int. Conference on Data Mining, pp. 313–320 (2001)Google Scholar
  13. 13.
    Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: VLDB (September 1994)Google Scholar
  14. 14.
    Zaki, M.: Efficiently Mining Frequent Trees in a Forest. In: ACM SIGMOD (2002)Google Scholar
  15. 15.
    Yang, L.N., Lee, M.L., Hsu, W.: Efficient Mining of XML Query Patterns for Caching. In: VLDB, Berlin, Germany (2003)Google Scholar
  16. 16.
    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)Google Scholar
  17. 17.
    Beoder, A.: On the Resemblance and Containment of Documents. In: IEEE SEQUENCES 1997, pp. 21–29 (1998)Google Scholar
  18. 18.
    Chen, Z., Korn, F., Koudas, N., Muthukrishnan, S., Ng, R.T., Srivastava, D.: Counting Twig Matches in a Tree. In: ICDE (2001)Google Scholar
  19. 19.
    Yannakakis, M.: Algorithm for acyclic database scheme. In: Zaniolo, Delovel (eds.) VLDB, Los Altos CA. Morgan Kaufman pubs., San Francisco (1981)Google Scholar
  20. 20.
    Amer-Yahia, S., Choo, S., Lakshmanan, L.V.S., Srivastava, D.: Minimization of tree pattern queries. In: SIGMOD (2001)Google Scholar
  21. 21.
    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)CrossRefGoogle Scholar
  22. 22.
    Appromixation Algorithms. Springer, Heidelberg (2001)Google Scholar
  23. 23.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Xin Zhan
    • 1
  • Jianzhong Li
    • 1
  • Hongzhi Wang
    • 1
  • Zhenying He
    • 1
  1. 1.Department of Computer Science and EngineeringHarbin Institute of TechnologyChina

Personalised recommendations