| Abstrakt: |
The rise of eXtensible Markup Language (XML) as a standard for data exchange and representation has made a lot of interest on querying XML documents that conform to an ordered tree-structured data model. It involves labeling, which assigns specific strings to XML documents. Existing schemes are based on natural order, lexicographical order or Variable Length Endless Insertable Code (VLEI) order, which needs relabeling. A novel order concept called vector order has been introduced, which is the basis of the dynamic labeling schemes. Vector order is a simple, yet most effective solution to process updates and it avoids relabeling during updation takes place. Existing dynamic XML labeling schemes, suffer from the complexity introduced by their insertion techniques even if there is less/no update. To make improvent the application of vector order has been proposed to both prefix-based labeling scheme and range based labeling scheme. However, all the existing techniques have high update cost, they cannot completely avoid relabeling in XML updation, it will increase the size of the label which will influence the query performance. By applying the vector order the label generation time, label size and querying time may be reduced during updation takes place. Hence it will improve the performance of the query system. [ABSTRACT FROM PUBLISHER] |
