Research Compression Coding Of Supporting For Updating XML Data

With the rapid development of the Internet technology, the Extensible Markup Language XML has been tremendous progress, XML has become the widely popular standard of representing and exchanging data. The main advantage of XML is that the structure and semantics of a clear information-rich, Therefore, more and more information to the form of XML documents stored and exchanged. However, because XML has a self-descriptive, multi-branch structure makes XML seem long, to the data storage and query cause great inconvenience. Therefore, how to efficiently store and query XML data has become a hot issue of database research in the field.In order to effectively store and query XML data, to better promote the application of XML, the researchers made a number of XML data encoding scheme, which improves coding efficiency of XML data storage and query, but they are in the storage space utilization, the node updates efficiency and query is still deficient in terms of speed, this paper carried out the relevant aspects of this research.So, In this paper, XML document encoding technology has been thoroughly analyzed, and proposed a new numbering scheme for XML documents. The coding scheme break down the node path information to avoid duplicate records, saving storage space; also supports data update, between any two codes can be inserted any number of new nodes will not be reserved space is used up and coding conflict completely avoid re-encoding of the node.The main work of this paper is as follows:(1) We carefully analyze existing data coding and query techniques. Storage space utilization of existing code is inefficient; can not effectively support the node dynamically updated; query technique frequently used structural join operation, the query performance by the impact of the length of path expression.(2) We propose a coding method of support for data update and update method. The coding scheme break down the node path information, avoiding duplication of information recorded at the same time increasing the flexibility of coding, which can effectively save storage space and support for dynamic data updates.(3) We proposed an efficient query methods, the query method completely avoids the structural join operation, the query time independent of path length and set the size of the intermediate results, to improve the efficiency of the query.(4) In the experiment, the coding scheme of this article and the code has been done a comparison results show that:in comparison with existing codes, this paper presents a coding scheme in the storage space utilization, the node updates both the efficiency and query speed a clear advantage.