| 本文已被：浏览 4576次 下载 7121次 |
码上扫一扫！ |
|
|
| 以目标节点为导向的XML路径查询处理 |
|
王静1, 孟小峰2, 王宇2, 王珊2
|
|
1.中国科学院,计算技术研究所,北京,100080;2.中国人民大学,信息学院,北京,100872
|
|
| 摘要: |
| XML查询语言将复杂路径表达式作为核心内容.为了加速路径表达式处理,基于路径分解和结构连接操作的处理策略需要更深入的研究.以目标节点为导向的XML路径查询处理框架被提了出来.该方法利用了扩展基本操作来减少连接操作的数目.在路径分解和查询计划选择的过程中,利用查询树中的目标节点来避免中间结果的传递.除了分解规则和策略以外,提出了一组扩展的基本操作和实现算法.初步的实验结果显示,该方法具有良好的性能.它为路径查询处理提供了更多的选择. |
| 关键词: XML查询处理 路径表达式 结构连接 选择性结构连接 路径索引 |
| DOI： |
| 分类号: |
| 基金项目:Supported by the 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 Ministry of Education of China(教育部优秀青年教师资助计划) |
|
| Target Node Aimed Path Expression Processing for XML Data |
|
WANG Jing,MENG Xiao-Feng,WANG Yu,WANG Shan
|
| 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 |
