DagSemProc.08261.8.pdf
- Filesize: 154 kB
- 9 pages
Document
Compression vs Queryability - A Case Study
Author
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 8261
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2008-11-20
Cite AsGet BibTex
Siva Anantharaman. Compression vs Queryability - A Case Study. In Structure-Based Compression of Complex Massive Data. Dagstuhl Seminar Proceedings, Volume 8261, pp. 1-9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
https://doi.org/10.4230/DagSemProc.08261.8
https://doi.org/10.4230/DagSemProc.08261.8
Abstract
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.
Keywords
- Tree automata
- Tree Grammars
- Dags
- XML documents
- Queries
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads