首页 | 本学科首页   官方微博 | 高级检索  
     检索      

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
基金项目: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  数据库  扩展  树结构
文章编号:1007-1202(2007)05-0855-06
收稿时间:7 February 2007
修稿时间:2007-02-07
本文献已被 维普 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号