关键词: 可扩展标记语言（XML）, 查询, 小枝模式, 递归, 前序, 后序, &ldquo, 调用/返回&rdquo, 操作

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.

Key words: Extensible Markup Language（XML）, query, twig pattern, recursion；preorder, postorder, “use and return&rdquo, operation