The XML benchmark project
Rewriting XPath queries using materialized views
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Query caching and view selection for XML databases
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Incremental sequence-based frequent query pattern mining from XML queries
Data Mining and Knowledge Discovery
A semantic cache framework for secure XML queries
Journal of Computer Science and Technology
Exploiting and Maintaining Materialized Views for XML Keyword Queries
ACM Transactions on Internet Technology (TOIT)
Hi-index | 0.00 |
In XML databases, materializing queries and their results into views in a semantic cache can improve the performance of query evaluation by reducing computational complexity and I/O cost. Although there are a number of proposals of semantic cache for XML queries, the issues of fast cache lookup and compensation query construction could be further studied. In this paper, based on sequential XPath queries, we propose fastCLU, a fast Cache LookUp algorithm and effiCQ, an efficient Compensation Query constructing algorithm to solve these two problems. Experimental results show that our algorithms outperform previous algorithms and can achieve good performance of query evaluation.