Query and update support for indexed and compressed XML (QUICX)

4Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The extensible Markup Language (XML) has evolved into a widespread standard for representation of voluminous data and data exchange among heterogeneous sources. The two major constraints in XML applications are its size and querying efficiently. In this paper, we have proposed an efficient storage structure called QUICX that supports both query and update efficiently. The storage space for the XML document is reduced substantially by completely eliminating redundant tags and data's. The size of data is further reduced by applying efficient compression techniques on the data's. Indexing is performed to the compressed data to increase the efficiency of querying; QUICX has significant improvements on compression ratio among its Peer systems. In effect QUICX provides a full fledged system to store and manipulate XML document efficiently. Performance has been evaluated using the Benchmark datasets using the existing techniques as well as with this proposed technique. From these evaluations, it is seen that the proposed compact storage structure and algorithm have significant improvements than the existing tested systems. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Senthilkumar, R., & Kannan, A. (2011). Query and update support for indexed and compressed XML (QUICX). In Communications in Computer and Information Science (Vol. 162 CCIS, pp. 414–428). https://doi.org/10.1007/978-3-642-21937-5_40

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free