TwigStack^+:Holistic Twig Join Pruning Using Extended Solution Extension  

作　　者：ZHOU Junfeng XIE Min MENG Xiaofeng 

机构地区：[1]School of Information, Renmin University of China, Beijing 100872, China [2]Department of Computer Science and Technology, Yanshan University, Qinhuangdao 066004, Hebei, China

出　　处：《Wuhan University Journal of Natural Sciences》2007年第5期855-860,共6页武汉大学学报（自然科学英文版）

基　　金：Supported by the National Natural Science Foundation of China (60573091, 60273018)

摘　　要：XML has been used extensively in many applications as a de facto standard for information representation and exchange over internet. Huge volumes of data are organized or exported in tree-structured form and the desired information can be got by traversing the whole tree structure using a twig pattern query. A new definition, Extended Solution Extension, is proposed in this paper to check the usefulness of an element from both forward and backward directions. Then a novel Extended Solution Extension based algorithm, TwigStack^＋, is also proposed to reduce the query processing cost, simply because it can check whether other elements can be processed together with the current one. Compared with existing methods, query evaluation cost can be largely reduced. The experimental results on various datasets indicate that the proposed algorithm performs significantly better than the existing ones.XML has been used extensively in many applications as a de facto standard for information representation and exchange over internet. Huge volumes of data are organized or exported in tree-structured form and the desired information can be got by traversing the whole tree structure using a twig pattern query. A new definition, Extended Solution Extension, is proposed in this paper to check the usefulness of an element from both forward and backward directions. Then a novel Extended Solution Extension based algorithm, TwigStack^＋, is also proposed to reduce the query processing cost, simply because it can check whether other elements can be processed together with the current one. Compared with existing methods, query evaluation cost can be largely reduced. The experimental results on various datasets indicate that the proposed algorithm performs significantly better than the existing ones.

关 键 词：XML DATABASE holistic join 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]