Efficient labeling scheme of XML data considering update operations

In this paper, we propose a new efficient labeling scheme for dynamic XML data streams. And we point out the limitations of existing access control and labeling schemes for XML data assuming that documents are frequently updated. We describe a persistent labeling scheme where labels are encoded ancestor-descendant relationships and sibling relationship between nodes but need not to be regenerated when the document is updated. Our labeling scheme supports an infinite number of updates and guarantees the arbitrary nodes insertion at arbitrary position of the XML tree without label collisions. Our experimental evaluation clearly demonstrates that our approach is an efficient.