Optimizing XML Compression in XQueC

Authors Andrei Arion, Angela Bonifati, Ioana Manolescu, Andrea Pugliese

Thumbnail PDF


  • Filesize: 218 kB
  • 12 pages

Document Identifiers

Author Details

Andrei Arion
Angela Bonifati
Ioana Manolescu
Andrea Pugliese

Cite AsGet BibTex

Andrei Arion, Angela Bonifati, Ioana Manolescu, and Andrea Pugliese. Optimizing XML Compression in XQueC. In Structure-Based Compression of Complex Massive Data. Dagstuhl Seminar Proceedings, Volume 8261, pp. 1-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)


We present our approach to the problem of optimizing compression choices in the context of the XQueC compressed XML database system. In XQueC, data items are aggregated into containers, which are further grouped to be compressed together. This way, XQueC is able to exploit data commonalities and to perform query evaluation in the compressed domain, with the aim of improving both compression and querying performance. However, different compression algorithms have different performance and support different sets of operations in the compressed domain. Therefore, choosing how to group containers and which compression algorithm to apply to each group is a challenging issue. We address this problem through an appropriate cost model and a suitable blend of heuristics which, based on a given query workload, are capable of driving appropriate compression choices.
  • XML compression


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads