一种基于前缀编码的查询算法

目前利用特定的编码方案对XML数据进行管理是一个研究热点,由于前缀编码Dewey具有较低的编码空间,并且支持AD关系、PC关系、之前之后关系和兄弟关系等结构顺序关系而得到了广泛应用.但是,与其它的编码比较,Dewey虽然支持各种关系计算但查询性能仍然不很理想.本文提出了一种新的算法,该算法利用字符串的顺序性,在常数时间内可以确定节点之间的结构顺序关系.实验结果显示,新算法与Dewey编码原有算法比较,在查询时间上就很大的提高.

A Querying Algorithm Based on Prefix Labeling

At present,the management of XML data based on some labeling scheme is a hot topic,Dewey labeling scheme,a prefix labeling scheme,which is widely applied because its labeling space is smaller and those relations of AD,PC,sibling,preceding and following are supported.But the querying performance of Dewey labeling scheme is lower than other labeling scheme.This paper puts forward a novel algorithm,which can determine the relation among nodes within constant time by string.The experiments show that the novel algorithm achieve better querying performance that previous Dewey.