Supporting efficient query processing on compressed XML files

Authors:
Yongjing Lin;Youtao Zhang;Quanzhong Li;Jun Yang
Affiliations:
University of Texas at Dallas, Richardson, TX;University of Texas at Dallas, Richardson, TX;IBM Almaden Research Center, San Jose, CA;University of California at Riverside, Riverside, CA
Venue:
Proceedings of the 2005 ACM symposium on Applied computing
Year:
2005

Citing 9
Cited 3

XMill: an efficient compressor for XML data

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Optimizing Regular Path Expressions Using Graph Schemas

ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Improving XML Processing Using Adapted Data Structures

Revised Papers from the NODe 2002 Web and Database-Related Workshops on Web, Web-Services, and Database Systems
Linear-Time, Incremental Hierarchy Inference for Compression

DCC '97 Proceedings of the Conference on Data Compression
XPRESS: a queriable compression for XML data

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
XGRIND: A Query-Friendly XML Compressor

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
XMark: a benchmark for XML data management

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Path queries on compressed XML

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
XQueC: pushing queries to compressed XML data

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29

XML compression techniques: A survey and comparison

Journal of Computer and System Sciences
Combining efficient XML compression with query processing

ADBIS'07 Proceedings of the 11th East European conference on Advances in databases and information systems
Interpolative coding of integer sequences supporting log-time random access

Information Processing and Management: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

XML has been widely accepted as the de facto format for data representation and exchange. However, it is also known for the excessive information redundancy in its representation. While various compression schemes have been proposed and some of them can support query processing over compressed files, it is usually inevitable to perform partial (or full) data decompression which is expensive and in some cases may dominate the query processing time.In this paper, we propose a new XML compression scheme based on the Sequitur compression algorithm. By organizing the compression result as a set of context free grammar rules, the scheme supports efficient processing of XPath queries without decompression. The experimental results show that this scheme achieves comparable compression ratio as gzip while its query processing time is among the best of existing algorithms.