计算机工程与应用2012，Vol.48Issue(11)：123-128,6.DOI:10.3778/j.issn.1002-8331.2012.11.027
POTwigStack:一种改进的XML小枝模式匹配算法
POTwigStack: improved algorithm of XML twig pattern matching
摘要
Abstract
At present, the algorithms of XML query based on twig pattern are hotspot of research. Most of them use recursive functions in accordance with preorder to find matching nodes, which brings too many unnecessary "use and return" operations. To solve this problem, an algorithm named POTwigStack is proposed, which uses a function named POgetNext to find matching nodes. The function is a recursive algorithm in accordance with postorder, which can avoid the useless operations of "use and return" effectively, and therefore the algorithm POTwigStack performs better.关键词
可扩展标记语言(XML)/查询/小枝模式/递归/前序/后序/“调用/返回”操作Key words
Extensible Markup Language (XML)/ query/ twig pattern/ recursion/ preorder/ postorder/ "use and return" operation分类
信息技术与安全科学引用本文复制引用
石隽锋,张剑妹..POTwigStack:一种改进的XML小枝模式匹配算法[J].计算机工程与应用,2012,48(11):123-128,6.基金项目
山西省高校科技开发项目(No.200811049). （No.200811049）
