收录:
摘要:
Extensible Markup Language (XML) has become a de facto standard for information representation and exchange over the Internet. The core operation of XML Query processing is twig pattern matching. TwigList uses simple lists to maintain the twig pattern instead of using the hierarchical-stacks, the algorithm outperforms Twig2Stack. Most of the modern twig query algorithms must scan the whole XML document tree to conduct the query matching. However, useless path matches increase query processing time. Existing approaches do not consider the fact in practice. In this paper, we propose a novel Twig query algorithm based on TwigList. The algorithm makes good use of XML Schema, avoids scanning the entire XML document and effectively improves the twig query performance. © 2010 IEEE.
关键词:
通讯作者信息:
电子邮件地址: