Title :

Regular Matching and Inclusion on Compressed Tree Patterns with Context Variables

Author(s) :

Boneva, Iovka [Auteur]
Linking Dynamic Data [LINKS]
Niehren, Joachim [Auteur]
Linking Dynamic Data [LINKS]
Sakho, Momar [Auteur]
Linking Dynamic Data [LINKS]

Conference title :

LATA 2019 - 13th International Conference on Language and Automata Theory and Applications

City :

Saint Petersburg

Country :

Russie

Start date of the conference :

2019-03-25

Publication date :

2019-01-24

English keyword(s) :

trees
tree languages and tree automata
Complex event processing
data streams
automata
computational complexity
patterns
queries

HAL domain(s) :

Informatique [cs]/Informatique et langage [cs.CL]

English abstract : [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 ...
Show more >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.Show less >

Language :

Anglais

Peer reviewed article :

Oui

Audience :

Internationale

Popular science :

Non

Collections :

• Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189

Source :

Harvested from HAL