DTD-driven structure preserving XML compression

Authors:
Stefan Böttcher;Rita Steinmetz
Affiliations:
University of Paderborn, Computer Science, Paderborn, Germany;University of Paderborn, Computer Science, Paderborn, Germany
Venue:
BNCOD'06 Proceedings of the 23rd British National Conference on Databases, conference on Flexible and Efficient Information Handling
Year:
2006

Citing 8
Cited 0

XMill: an efficient compressor for XML data

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Trie memory

Communications of the ACM
Algorithms and programming models for efficient representation of XML for Internet applications

Proceedings of the 10th international conference on World Wide Web
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
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
Efficient memory representation of XML documents

DBPL'05 Proceedings of the 10th international conference on Database Programming Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

Whenever XML is used as the data format to exchange large amounts of data or even for data streams, the verbose behavior of XML is one of the bottle necks. While compression of XML data seems to be a way out, it is essential for a variety of applications that the compression result still can be parsed, searched, transformed or modified efficiently. In order to support efficient search in compressed XML data, we have devel oped a compression technique that links two components: the first component uses the DTD to perform a structure-preserving compression of XML markup data, while the second uses a trie for the compression of text constants and attribute values.