BSC:An Efficient Numbering Scheme for Dynamic XML Trees
Chen Wang · 2008
It is very important to detect whether there are structural relationships between two nodes in XML queries. The numbering scheme is designed to label the XML nodes so that the structural relationships between nodes can be easily determined by comparing their labels without accessing the original XML file. With the increasing popularity and application of XML related standards,it is urgent to find a numbering scheme that is able to support XML data updates. This paper presents a novel XML tree numbering scheme,called BSC,which takes advantage of the property of binary decimal numbers and can completely avoid re-labeling any existing nodes when the XML update is performed in any case. Our experimental results show that BSC works much better than the existing dynamic numbering schemes considering either the static numbering or the XML data updates.