Regular Matching and Inclusion on Compressed ...
Type de document :
Communication dans un congrès avec actes
Titre :
Regular Matching and Inclusion on Compressed Tree Patterns with Context Variables
Auteur(s) :
Boneva, Iovka [Auteur]
Linking Dynamic Data [LINKS]
Niehren, Joachim [Auteur]
Linking Dynamic Data [LINKS]
Sakho, Momar [Auteur]
Linking Dynamic Data [LINKS]
Linking Dynamic Data [LINKS]
Niehren, Joachim [Auteur]
Linking Dynamic Data [LINKS]
Sakho, Momar [Auteur]
Linking Dynamic Data [LINKS]
Titre de la manifestation scientifique :
LATA 2019 - 13th International Conference on Language and Automata Theory and Applications
Ville :
Saint Petersburg
Pays :
Russie
Date de début de la manifestation scientifique :
2019-03-25
Date de publication :
2019-01-24
Mot(s)-clé(s) en anglais :
trees
tree languages and tree automata
Complex event processing
data streams
automata
computational complexity
patterns
queries
tree languages and tree automata
Complex event processing
data streams
automata
computational complexity
patterns
queries
Discipline(s) HAL :
Informatique [cs]/Informatique et langage [cs.CL]
Résumé en anglais : [en]
We study the complexity of regular matching and inclusion for compressed tree patterns extended by context variables. The addition of context variables to tree patterns permits us to properly capture compressed string ...
Lire la suite >We study the complexity of regular matching and inclusion for compressed tree patterns extended by context variables. The addition of context variables to tree patterns permits us to properly capture compressed string patterns but also compressed patterns for unranked trees with tree and hedge variables. Regular inclusion for the latter is relevant to certain query answering on Xml streams with references.Lire moins >
Lire la suite >We study the complexity of regular matching and inclusion for compressed tree patterns extended by context variables. The addition of context variables to tree patterns permits us to properly capture compressed string patterns but also compressed patterns for unranked trees with tree and hedge variables. Regular inclusion for the latter is relevant to certain query answering on Xml streams with references.Lire moins >
Langue :
Anglais
Comité de lecture :
Oui
Audience :
Internationale
Vulgarisation :
Non
Collections :
Source :
Fichiers
- https://hal.inria.fr/hal-01811835v4/document
- Accès libre
- Accéder au document
- https://hal.inria.fr/hal-01811835v4/document
- Accès libre
- Accéder au document
- https://hal.inria.fr/hal-01811835v4/document
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document
- 0-short.pdf
- Accès libre
- Accéder au document