Mining Positive and Negative Association Rules from XML Query Patterns for Caching
Mining Positive and Negative Association Rules from XML Query Patterns for Caching
复制标题
DOI：
10.1007/11408079_67
复制
发表时间：
2005-04
期刊：
影响因子：
--
通讯作者：
Ling Chen;S. Bhowmick;L. Chia
中科院分区：
文献类型：
--
作者：
Ling Chen;S. Bhowmick;L. Chia
近年来，人们提出了几种挖掘频繁XML查询模式并缓存其结果的方法来提高查询响应时间。然而，这些方法挖掘的频繁XML查询模式忽略了用户查询之间的时间序列。在本文中，我们考虑到用户查询的时间特性来发现关联规则，这表明当用户从XML文档中查询某些信息时，她/他可能会随后查询其他信息。我们首先根据XML查询的语义进行聚类，然后挖掘聚类之间的关联规则。此外，不仅是积极的，而且消极的关联规则被发现，以设计适当的缓存替换策略。实验结果表明，我们的方法大大提高了缓存性能显着减少查询响应时间。
Recently, several approaches that mine frequent XML query patterns and cache their results have been proposed to improve query response time. However, frequent XML query patterns mined by these approaches ignore the temporal sequence between user queries. In this paper, we take into account the temporal features of user queries to discover association rules, which indicate that when a user inquires some information from the XML document, she/he will probably inquire some other information subsequently. We cluster XML queries according to their semantics first and then mine association rules between the clusters. Moreover, not only positive but also negative association rules are discovered to design the appropriate cache replacement strategy. The experimental results showed that our approach considerably improved the caching performance by significantly reducing the query response time.