Study on XML relational query using code compression

This article promises a method of XML document storing and querying effectively, and improves storing and querying of XML documents effectively, and avoids multi-level complex data conversion in processing XML data, and presents an effective method to compress original code. In analysis of original code, the method recoded the redundant information that only left brother node storages the Huffman codes, other brothers' node storage compression codes. This article analyzes the change of compress storage space before and after, and queries the documents with the compressing codes. The compressing codes express the information and structure of document. The authors have offered experimental results under different conditions and have compared with other research results in this work. The experiment shows the work of this paper is meaningful.