摘要
解决了基于序列的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.
出处
《计算机应用》
CSCD
北大核心
2008年第3期753-756,760,共5页
journal of Computer Applications
基金
国家自然科学基金资助项目(60573094)
清华大学基础研究基金资助项目(JCqn2005022)
浙江自然科学基金资助项目(Y105230)
关键词
序列匹配
分支查询求解
唯一深度优先遍历序列
sequence matching
twig query evaluation
Unique Depth-First Traversal Sequence （UDFTS）
