Caching frequent XML query patterns

Authors:
Xin Zhan;Jianzhong Li;Hongzhi Wang;Zhenying He
Affiliations:
Department of Computer Science and Engineering, Harbin Institute of Technology, China;Department of Computer Science and Engineering, Harbin Institute of Technology, China;Department of Computer Science and Engineering, Harbin Institute of Technology, China;Department of Computer Science and Engineering, Harbin Institute of Technology, China
Venue:
APWeb'06 Proceedings of the 2006 international conference on Advanced Web and Network Technologies, and Applications
Year:
2006

Citing 17
Cited 1

Querying network directories

SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Minimization of tree pattern queries

SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Containment and equivalence for an XPath fragment

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A fine-grained replacement strategy for XML query cache

Proceedings of the 4th international workshop on Web information and data management
Estimating Answer Sizes for XML Queries

EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Index Structures for Path Expressions

ICDT '99 Proceedings of the 7th International Conference on Database Theory
Counting Twig Matches in a Tree

Proceedings of the 17th International Conference on Data Engineering
Frequent Subgraph Discovery

ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Loading a Cache with Query Results

VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Semantic Data Caching and Replacement

VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Semantic caching of Web queries

The VLDB Journal — The International Journal on Very Large Data Bases
Efficiently mining frequent trees in a forest

Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
On the Resemblance and Containment of Documents

SEQUENCES '97 Proceedings of the Compression and Complexity of Sequences 1997
Algorithms for acyclic database schemes

VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Efficient mining of XML query patterns for caching

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
On the minimization of Xpath queries

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29

A Performance Analysis of Semantic Caching for XML Query Processing

International Journal of Knowledge-Based Organizations

Quantified Score

Hi-index	0.00

Visualization

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.