一种XML多分支路径索引查询算法  

A XML Multiple Branch Path Query Algorithm Based on Index

作　　者：吉根林[1] 肖袁[1] 

机构地区：[1]南京师范大学数学与计算机科学学院,江苏南京210097

出　　处：《南京师范大学学报（工程技术版）》2007年第1期63-67,共5页Journal of Nanjing Normal University(Engineering and Technology Edition)

基　　金：江苏省高校自然科学基金(04KJB520075)资助项目

摘　　要：为高效地实现XML多分支路径查询,提出了基于索引的XML多分支路径查询算法depthjoin.首先对XML文档进行编码并创建索引,然后对查询树进行查询匹配.采用栈存储多分支路径中的单路径,对多分支结点采用索引信息判定其子结点是否具有共同的祖先结点或父结点.与现有的XML分支查询算法相比,算法depthjoin充分利用索引,不需要进行单路径的连接操作,实验表明其查询效率比现有的查询算法高.XML single path query methods and simple branch path query methods have been presented, but how to query multiple branch path is not solved well. This paper presents the algorithm depthjoin for querying XML multiple branch path based on index. The algorithm encodes the XML documents and creates an index for them. It restores the single path of the multiple branches path using stack on the process of matching of the query tree, judging if the branch nodes have the same ancestors or parent by the index. Compared with the existing algorithms, the algorithm does not need join the single paths. The query efficiency is superior to the existing algorithms.

关 键 词：XML查询 XML索引 XML多分支路径查询 

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