A Querying Algorithm Based on Prefix Labeling
Qin Zun-yue · Journal of Huaihua University · 2010
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.