Efficient Compression, Querying and Updating XML Repositories Using Hash Indexing Method


XML has become the de facto standard for data representation and data communication over the World Wide Web. Due to the self describing nature of XML, it is accepted World Wide as a data exchange. But the same self describing ability makes it verbose and thus introduces redundancy in the document. This large document size also affects efficiency of time and efficiency of storage while transmitting, processing and storing the data. Therefore it is better to use efficient compression techniques for storage and querying. Several XML compression techniques have been introduced from past few years. However those compression techniques require decompression to query the XML document, do not support dynamic updating and also results in huge storage. In this paper we introduce a different approach for compression. Our approach exploits consecutive sub trees and tags for compression using pre order labeling scheme and stores it using indexers, thus resulting in an efficient query processing and reduced storage requirement.

  • Abstract
  • Key Words
  • 1. Introduction
  • 2. Related Work
  • 3. Our Approach
  • 4. Results and Discussion
  • 5. Summaries
  • References

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In