Dynamic Containment Based Binary String Labeling Approach For XML Tree

The labeling scheme is used to label the nodes ofan XML tree. Based on the labeling scheme,XML queries can be processed without accessingthe original XML document. One more importantpoint for the labeling scheme is to processupdates when nodes are inserted into or deletedfrom the XML tree. In this paper, we propose anode labeling scheme that solves the weak pointsof the prefix, prime, interval and containmentbased schemes by supporting efficient insertprocessing. The weak points of previousschemes are re-labeling when subtree or nodeinsert to XML tree, a large number of nodes thatneed to be relabeled in the case of an insertion ofXML data, and inefficient processing ofstructural joins. To address this weak point,dynamic containment based binary stringlabeling approach for XML tree is proposed inthis paper. This scheme uses containment basedbinary string for label dynamic XML tree andconcatenation of binary string and charactersequences for label insertion XML subtree