一种基于层次栈的XML数据小枝查询算法研究

A Twig Query Algorithm Based on Hierarchical Stack Structure for Xml Data

当前针对小枝模式的XML查询是XML文档查询的研究热点。文章在分析XML数据小枝查询处理常用算法的基础上,提出了一种高灵活性的、易确定结点对之间结构关系的EDiezt-P编码,并基于EDiezt-P编码和层次栈结构提出了一种自底向上的小枝查询算法。实验表明,该算法在一定程度上减少了查询处理时间,提高了查询效率。

Nowadays,many researchers focus on Twig query strategy for XML data.In this paper we firstly analyze several general twig query algorithms for XML data.Then a new encoding scheme named as EDiezt-P is proposed which is highly flexible and easy to determine the structure relationship of the nodes.Based on this new EDiezt-P encoding and the hierarchical stack encoding.TwigStack-HST algorithm is presented,which is a new bottom-up twig query algorithm.From our experiments,using our new TwigStack-HST algorithm,the query processing time was shortened and the the query efficiency is improved.