Bottom-up mining of XML query patterns to improve XML querying  

作　　者：Yi-jun BEI Gang CHEN Jin-xiang DONG Ke CHEN 

机构地区：[1]School of Computer Science and Technology, Zhejiang University, Hangzhou 310027, China

出　　处：《Journal of Zhejiang University-Science A(Applied Physics & Engineering)》2008年第6期744-757,共14页浙江大学学报（英文版）A辑（应用物理与工程）

基　　金：the National Natural Science Foundation of China (No. 60603044);the National Key Technologies Supporting Program of China during the 11th Five-Year Plan Period (No. 2006BAH02A03);the Program for Changjiang Scholars and Innovative Research Team in University of China (No. IRT0652)

摘　　要：Querying XML data is a computationally expensive process due to the complex nature of both the XML data and the XML queries. In this paper we propose an approach to expedite XML query processing by caching the results of frequent queries. We discover frequent query patterns from user-issued queries using an efficient bottom-up mining approach called VBUXMiner. VBUXMiner consists of two main steps. First, all queries are merged into a summary structure named "compressed global tree guide" (CGTG). Second, a bottom-up traversal scheme based on the CGTG is employed to generate frequent query patterns. We use the frequent query patterns in a cache mechanism to improve the XML query performance. Experimental results show that our proposed mining approach outperforms the previous mining algorithms for XML queries, such as XQPMinerTID and FastXMiner, and that by caching the results of frequent query patterns, XML query performance can be dramatically improved.Querying XML data is a computationally expensive process due to the complex nature of both the XML data and the XML queries. In this paper we propose an approach to expedite XML query processing by caching the results of frequent queries. We discover frequent query patterns from user-issued queries using an efficient bottom-up mining approach called VBUXMiner. VBUXMiner consists of two main steps. First, all queries are merged into a summary structure named ＂compressed global tree guide＂ （CGTG）. Second, a bottom-up traversal scheme based on the CGTG is employed to generate frequent query patterns. We use the frequent query patterns in a cache mechanism to improve the XML query performance. Experimental results show that our proposed mining approach outperforms the previous mining algorithms for XML queries, such as XQPMinerTID and FastXMiner, and that by caching the results of frequent query patterns, XML query performance can be dramatically improved.

关 键 词：XML querying XML mining CACHING Data mining 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]