XML Query New Stratery Using Prefix Code Reseach

XML is becoming the de facto standard for information publication and exchange on the Web, substituting for HTML. Comparing to HTML, XML is simple, self-describing and the content, structure and representation of XML documents are independent, which makes XML more suitable for data representation and exchange on the Internet. Recently, XML has been widely used in various applications, and very large volumes of XML data have been appeared in the Web, Information System and e-business. To organize, manage, store and query XML data efficiently is concern issues of XML research. Different query languages and storage approaches have been propose by researcher.As a viable and promising approach, using RDBMS to manage XML data is extensively studied in recent years. However, XML data of relation storage need to construct and conjunct intermediate results of multiple sub-inquire at dealing with XML complicated pathway expression consultation. Therefore, it needs to realize the definition construction relationship at multiple correlation charts. That will lead to increase of time and calculation load of XML data consultation. However, prefix encode is in sequence, its encoding calculation is comparatively simple. It can not only preserve the containing relations between parents/children, ancestor/descendant conjunction, but also it can keep the information of position relations of XML files. It can be a convenient tool to compare any two junction relationship.We put forward a method to sustain XML data search with the good characteristics of prefix code. In the new method, we present the longest prefix code matching. For the XML data on the basis of relationship, when we deal with complex path search expression, we can filtrate from the results of structure link and obtain the final results using the longest prefix code matching. Compared to the traditional XML memory search method on the basis of relationship, our method is more effective when we deal with complex XML path search. To improve search XML data using the longest prefix code matching method, according to the characteristics of two stages in XML path search expression, we also present two different patterns of XML data memory methods. And we describe the specific search process of XML data, compare with capability of other models, and introduce the experiment process and results. To understand the text better, we also simply describe the related knowledge and theory to XML, XML search techniques, XML coding methods and several typical XML database techniques.