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

基于区域划分的XML结构连接
引用本文:王静,孟小峰,王珊.基于区域划分的XML结构连接[J].软件学报,2004,15(5):720-729.
作者姓名:王静  孟小峰  王珊
作者单位:1. 中国科学院,计算技术研究所,北京,100080
2. 中国人民大学,信息学院,北京,100872
基金项目:Supported bythe National Natural Science Foundation of China under Grant Nos.60073014,60273018(国家自然科学基金);the National High-Tech Research and Development Plan of China under Grant No.2002AA116030(国家高技术研究发展计划(863));the Key Project of the Key Project of the Ministry of Education of China under Grant No.03044(国家教育部科学技术重点项目);the Excellent Young Teachers Program of Ministry of Education of China(国家教育部优秀青年教师资助计划)
摘    要:结构连接是XML查询处理的核心操作,受到了研究界的关注.高效的算法是高效查询处理的关键.目前已经提出了许多结构连接的算法,它们中的大多数都基于如下的前提条件之一:输入元素集合存在索引或者有序.当这些条件不成立时,由于对输入数据临时排序或建索引的代价,这些算法的性能会大大下降.基于这样的观察,提出了一种基于区域划分的结构连接算法.该算法基于任务分解的思想,利用区域编码的特点对输入集合进行划分.给出了详细的算法设计,并对算法的I/O复杂性进行了分析.大量的实验结果显示,该算法具有良好的 性能,在输入数据无序或没有索引的情况下优于现有的排序合并算法,可以为查询计划提供更多的选择.

关 键 词:XML查询处理  路径表达式  编码方法  结构连接
文章编号:1000-9825/2004/15(05)0720
收稿时间:3/2/2003 12:00:00 AM
修稿时间:2003年3月2日

Structural Join of XML Based on Range Partitioning
WANG Jing,MENG Xiao-Feng and WANG Shan.Structural Join of XML Based on Range Partitioning[J].Journal of Software,2004,15(5):720-729.
Authors:WANG Jing  MENG Xiao-Feng and WANG Shan
Abstract:Structural join is the core operation in XML query processing, and catches the research community's attention. Efficient algorithm is the key of efficient query processing. There have been a number of algorithms proposed for structural join, and most of them are based on one of the following assumptions: the input element sets either have indexes or are ordered. When these assumptions are not true, the performance of these algorithms will become very bad due to the cost of sorting input sets or building index on the fly. Motivated by this observation, a structural join algorithm based on range partitioning is proposed in this paper. Based on the idea of task decomposition, this algorithm takes advantage of the region numbering scheme to partition the input sets. The procedure of the algorithm is described in detail, and its I/O complexity is analyzed. The results of the extensive experiments show that this algorithm has good performance and is superior to the existing sort-merge algorithms when the input data are not sorted or indexed. It can provide query plans with more choices.
Keywords:XML query processing  path expression  numbering scheme  structural join
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《软件学报》浏览原始摘要信息
点击此处可从《软件学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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