【摘要】 为解决XML数据库中的结构关系查询问题,本文以Dewey向量为基础,提出了基于Dewey向量的B~+树(Dewey Vector Based B~+ Tree,简称为 DVBB)双栈结构连接算法。该算法利用了两个栈,PublicStack和 Privat-eStack,在这两个栈的基础上,利用DVBB索引,能够最大限度地避免那些不能产生连接结果的元素参加连接运算。一系列的实验结果表明,基于DVBB的双栈结构连接算法,无论是对于有效的跳过“祖先”还是“后代”节点,都具有很高的性能。更多还原

【Abstract】 To evaluate the primitive structural relationships of XML data, a new algorithm named DVBB (Dewey Vec- tor Based B~+ tree)is proposed in this paper. Unlike the traditional way, DVBB employs the Dewey Vector to encode XML elements, and performs structural joins on the DVBB index. This algorithm can effectively skip the elements which cannot produce the join results with two stacks, PublicStack and PrivateStack. An extensive of experiments show that the DVBB algorithm can gain the best efficiency in structural joins.更多还原