 |
Université d'Orléans |  |
|
Université d'Orléans | |
| HAL : inria-00449563, version 1 |
| Voir la fiche détaillée |  BibTeX,EndNote,... |
 |
| Dagstuhl Seminar 08621, Dagstuhl : Allemagne (2008) |
|
|
|
|
| Compression vs Queryability - A Case Study |
|
|
| Siva Anantharaman 1 |
|
|
| (11/2008) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Laboratoire d'Informatique Fondamentale d'Orléans (LIFO) |
|
|
|
Université d'Orléans : EA4022 – Ecole Nationale Supérieure d'Ingénieurs de Bourges |
|
|
|
|
|
|
|
|
|
| Domaine | : | Informatique/Logique en informatique |
|
|
| Tree automata – Tree Grammars – Dags – XML documents – Queries. |
|
|
|
| Liste des fichiers attachés à ce document : | |||||
|
|||||
|
|
|
| inria-00449563, version 1 | |
| http://hal.inria.fr/inria-00449563 | |
| oai:hal.inria.fr:inria-00449563 | |
| Contributeur : Siva Anantharaman | |
| Soumis le : Vendredi 22 Janvier 2010, 10:03:29 | |
| Dernière modification le : Mercredi 31 Mars 2010, 17:13:08 | |
