一种高效的XMLQuery基本模式匹配算法

有效的支持结构连接是实现数据库系统XML文件查询的关键。结构连接是用来查找所有满足基本的结构关系的元素对,即指定XML树型结构文件元素对的关系(父亲-孩子和祖先-子孙的关系)。文中在分析常见的XMLQuery模式匹配算法(Stack-Tree连接算法)的基础上,提出一种改进的Stack-Tree连接算法将Stack-Tree-Desc算法和Stack-Tree-Anc算法统一;并且采用动态分配存储空间方法,比Stack-Tree-Anc大大节省了存储空间。最后给出了改进的Stack-Tree连接算法分析和试验结果。

A Primitive for Efficient XMLQuery Pattern Matching Algorithm

Efficient support for structural joins is the key to efficient implementations of XML queries on database system.Structural joins are used to find all pairs of elements satisfying in the query,namely,parent-child and ancestor-descendant relationships.An improved algorithm is proposed to unify two algorithms of Stack-Tree-Desc and Stack-Tree-Anc together;also to use dynamic method to greatly save the storing space.In the end,the analysis of this algorithm's performance and results of experiment are given.