路径查询的分解计算软件学报.DOC

以目标节点为导向的XML路径查询处理( 王 静1, 孟小峰2, 王 宇2+, 王 珊2 1(中国科学院 计算技术研究所,北京 100080) 2(中国人民大学 信息学院,北京 100872) Target Node Aimed Path Expression Processing for XML Data WANG Jing1, MENG Xiao-Feng2, WANG Yu2+, WANG Shan2 1(Institute of Computing Technology, The Chinese Academy of Sciences, Beijing 100080, China) 2(Information School, Renmin University of China, Beijing 100872, China) + Corresponding author: Phn: +86-10 Fax: 86-10 E-mail: sandpiperwy@ Received 2003-12-25; Accepted 2004-06-10 Wang J, Meng XF, Wang Y, Wang S. Target node aimed path expression processing for XML data. Journal of Software, 2005,16(5):827?837. DOI: 10.1360/jos160827 Abstract: XML query languages take complex path expressions as their core. To facilitate path expression processing, the processing strategy based on path decomposition and structural join operation needs to be investigated more deeply. In this paper, a target node aimed at path expression processing framework for XML data is proposed. This approach makes use of the extended basic operations to reduce the number of join operations. In the procedure of path decomposition and query plan selection, target node in the query tree is utilized to avoid the transfer of the intermediate results. In addition to decomposition rules and strategies, a set of extended basic operations and implementation algorithms are proposed. Preliminary experiments indicate this approach has good performance. It provides path query processing with more choices. Key words: XML query processing; path expression; structural join; selective structural join; path index 摘 要: XML查询语言将复杂路径表达式作为核心内容.为了加速路径表达式处理,基于路径分解和结构连接操作的处理策略需要更深入的研究.以目标节点为导向的XML路径查询处理框架被提了出来.该方法利用了扩展基本操作来减少连接操作的数目.在路径分解和查询计划选择的过程中,利用查询树中的目标节点来避免中间结果的传递.除了分解规则和策略以外,提出了一组扩展的基本操作和实现算法.初步的实验结果显示,该方法具有良好的性能.它为路径查询处理提供了更多的选择. 关键词: XML查询处理;路径表达式;结构连接;选择性结构连接;路径索引 中图法分类号: TP311　　　文献标识码: A 随着XML[1]标准被广泛接收和采用,XML数据的管理和查询问题也引起了人们的重视,成为研究的热点.尽管XML可以描述非常复杂的结构,其本质仍然是树状的数据.针对XML的查询,学者们已经提出了