Compression vs Queryability - A Case Study - Archive ouverte HAL Access content directly
Conference Papers Year : 2008

Compression vs Queryability - A Case Study


Some compromise on compression is known to be necessary, if the relative positions of the information stored by semi-structured documents are to remain accessible under queries. With this in view, we compare, on an example, the `query-friendliness' of XML documents, when compressed into straightline tree grammars which are either regular or context-free. The queries considered are in a limited fragment of XPath, corresponding to a type of patterns; each such query defines naturally a non-deterministic, bottom-up `query automaton' that runs just as well on a tree as on its compressed dag.
Fichier principal
Vignette du fichier
PostDagstuhl08-Siva.pdf (130.46 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

inria-00449563 , version 1 (22-01-2010)


  • HAL Id : inria-00449563 , version 1


Siva Anantharaman. Compression vs Queryability - A Case Study. Dagstuhl Seminar 08621, Jun 2008, Dagstuhl, Germany. ⟨inria-00449563⟩
85 View
78 Download


Gmail Mastodon Facebook X LinkedIn More