一种高效的XML多分支路径查询算法  

AN EFFICIENT QUERY ALGORITHM FOR XML MULTIPLE BRANCHES PATH

作　　者：肖袁[1] 

机构地区：[1]解放军南京政治学院,江苏南京210003

出　　处：《计算机应用与软件》2010年第7期152-155,共4页Computer Applications and Software

摘　　要：目前XML单路径查询和简单的分支路径查询已经得到了较好的解决,但如何高效地实现XML多分支路径查询还没有很好的方法。提出一种高效的XML多分支查询算法MBPQ。算法MBPQ首先对XML文档和被查询的多分支路径结点分别按照各自不同的方式进行编码,并将被查询的多分支路径拆分成单路径,最后将单路径查询匹配成多分支查询结果。在单路径查询结果匹配过程中,算法MBPQ利用栈控制匹配过程,按照查询树从左到右、自底向上的顺序匹配具有共同祖先结点的单路径查询结果,从而提高匹配效率。实验表明,与现有的XML多分支查询一般算法相比,算法MBPQ的查询效率高。XML single path query and simple branch path query algorithms have been well resolved at present,but how to query multiple branches path efficiently has not found a good solution yet.This paper presents an efficient algorithm MBPQ in this regard.First,the XML document and the codes of multiple branches path queried are encoded in algorithm MBPQ according to the way of their own respectively,and then the multiple branches path being queried is disjointed into single paths,at last the queries executed on single paths are matched to a result of multiple branches path＇s.A stack is used in algorithm MBPQ to control the match process in the course of single path query results matching,those query results having same ancestor codes are matched in sequence of left to right and bottom to top in query tree,so as to boost the matching efficiency.Experiment results state that the algorithm MBPQ is efficient in query compared with existing ordinary query algorithms of XML multiple branches.

关 键 词：XML查询 XML多分支路径查询 XML编码 

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