Browser

Research for the Algorithm of Query to Compressed XML Data

Free registration required

Executive Summary

Because XML data is increasingly becoming the standard of transmission and distribution of Internet and enterprise's data in a common format. Efficient algorithms of compression and query in XML data can directly reduce the cost of storage of data and shorten response time of query. Studying in this aspect is widely promising. This article proposed an equivalence relation on the basis of characters of XML, and proved the rationality of the index and the feasibility of query algorithm on this method, then put forward a new query algorithm on the compressed index. Finally, compared with XGrind that supports query on the partial decompression of compressed XML data in experiment.

  • Format: PDF
  • Size: 173.5 KB