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. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Zhan, X., Li, J., Wang, H., & He, Z. (2006). Caching frequent XML query patterns. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3842 LNCS, pp. 68–75). https://doi.org/10.1007/11610496_8
Mendeley helps you to discover research relevant for your work.