一种新的基于划分的结构连接算法  

A New Partition-based Structural Join Algorithm

作　　者：任家东[1] 尹晓鹏[1] 郭晓丹[1] 

机构地区：[1]燕山大学信息科学与工程学院,秦皇岛066004

出　　处：《计算机工程》2007年第6期95-97,共3页Computer Engineering

摘　　要：有效的结构连接是XML查询处理的关键。目前,大部分结构连接算法由于需要临时排序、建立索引或存在数据复制及I/O问题,大大降低了执行效率。该文在分析比较现有结构连接算法的基础上,提出了一种新的基于划分的结构连接算法。该算法不需要排序或建立索引,通过栈的机制解决了数据复制问题,并充分考虑内存缓冲提高了I/O性能。实验分析表明该算法具有良好的查询性能。Efficient structural join is the key operation in XML query processing. Now, most of the structural join algorithms have poor performance because of the requirement of sorting and indexing and the problems of data replication and I/O overhead. A new partition-based structural join algorithm which does not need to sort and index is proposed based on analyzing some popular algorithms. It utilizes the stack to avoid replication and improves the I/O performance by considering the memory buffers. The experimental analysis shows that the algorithm can support query processing efficiently.

关 键 词：结构连接 区域编码 路径表达式 内存缓冲 

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