Fast and Tiny Structural Self-Indexes for XML

Abstract : XML document markup is highly repetitive and therefore well compressible using dictionary-based methods such as DAGs or grammars. In the context of selectivity estimation, grammar-compressed trees were used before as synopsis for structural XPath queries. Here a fully-fledged index over such grammars is presented. The index allows to execute arbitrary tree algorithms with a slow-down that is comparable to the space improvement. More interestingly, certain algorithms execute much faster over the index (because no decompression occurs). E.g., for structural XPath count queries, evaluating over the index is faster than previous XPath implementations, often by two orders of magnitude. The index also allows to serialize XML results (including texts) faster than previous systems, by a factor of ca. 2-3. This is due to efficient copy handling of grammar repetitions, and because materialization is totally avoided. In order to compare with twig join implementations, we implemented a materializer which writes out pre-order numbers of result nodes, and show its competitiveness.
Type de document :
Pré-publication, Document de travail
13 pages. 2010
Liste complète des métadonnées
Contributeur : Tom Sebastian <>
Soumis le : mercredi 30 octobre 2013 - 16:39:52
Dernière modification le : jeudi 11 janvier 2018 - 06:20:12

Lien texte intégral


  • HAL Id : hal-00878721, version 1
  • ARXIV : 1012.5696



Sebastian Maneth, Tom Sebastian. Fast and Tiny Structural Self-Indexes for XML. 13 pages. 2010. 〈hal-00878721〉



Consultations de la notice