Efficient XML Search Algorithm Based On Sub-band Index Storage Structure

XML has been a standard to denote and tool to exchange data in Internet.But it's data has a big redundancy. First,Redundancy will waste huge storing space,second it can increase I/O time for querying manage. At present,compress is a good method to minish capacity of XML.but after compressing,XML need to decompress,then it is can be validated and queried. solving the problem that how to compress XML document then after compressing to seach is very important.First, a number of existing XML compression method and the technical characteristics of the structure of a detailed description of an analysis of various technical advantages and disadvantages, compared the performanceof various compression methods.Second,introduce The ITOS store structure and the structure information and value information in The ITOS.Third,The paper put forward batch querying algorithm and value querying algorithm base on ITOS. Comparing XPath, XQuery,traditional batch querying and traditional value querying.Theoretical analysis and experimental results illustrate the algorithm has good scalability and high efficiency of query execution.At last, the MyEclipse IDE with the establishment of a test platform. First of all, the platform to build a tree-like XML model to generate XML. Followed by simulation of their data, given the establishment of the principle of the model and data, and analysis of the data.