一种高效的基于序列匹配的XML求解算法——SCALER+  

Efficient algorithm for XML query based sequence matching——SCALER+

作　　者：刘乐[1] 冯建华[1] 

机构地区：[1]清华大学计算机科学与技术系,北京100084

出　　处：《计算机应用》2008年第3期753-756,760,共5页journal of Computer Applications

基　　金：国家自然科学基金资助项目(60573094);清华大学基础研究基金资助项目(JCqn2005022);浙江自然科学基金资助项目(Y105230)

摘　　要：解决了基于序列的XML查询算法(SCALER)存在的两个问题,一是明确地对通配符*和后代轴//的支持,二是支持兄弟节点无序的模式树的查询。扩展后的算法命名为SCALER+,实验结果证明它不仅具有与SCALER一样优异的性能,而且对分支查询的求解更加完备。The problems of SequenCe bAsed XML QuEry AlgoRithm （SCALER） were solved. The first was definitely supporting wildcard ＊ and descendant axis //, and the second was supporting queries of pattern trees with. out-of-order brother nodes. The extended algorithm was named SCALER ＋. Experimental results prove that it is efficient as SCALER and stronger for twig query evaluation.

关 键 词：序列匹配 分支查询求解 唯一深度优先遍历序列 

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