Regular Matching and Inclusion on Compressed Tree Patterns with Context Variables - Archive ouverte HAL Access content directly
Conference Papers Year : 2019

Regular Matching and Inclusion on Compressed Tree Patterns with Context Variables

(1) , (1) , (1)
1
Iovka Boneva
Joachim Niehren
Momar Sakho
  • Function : Author
  • PersonId : 1019942

Abstract

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.
Fichier principal
Vignette du fichier
0-short.pdf (368.32 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01811835 , version 1 (11-06-2018)
hal-01811835 , version 2 (18-03-2019)
hal-01811835 , version 3 (25-06-2019)
hal-01811835 , version 4 (27-06-2019)

Identifiers

  • HAL Id : hal-01811835 , version 4

Cite

Iovka Boneva, Joachim Niehren, Momar Sakho. Regular Matching and Inclusion on Compressed Tree Patterns with Context Variables. LATA 2019 - 13th International Conference on Language and Automata Theory and Applications, Mar 2019, Saint Petersburg, Russia. ⟨hal-01811835v4⟩
225 View
215 Download

Share

Gmail Facebook Twitter LinkedIn More