Regular Matching and Inclusion on Compressed Tree Patterns with Constrained Context Variables
Résumé
We study the complexity of regular matching and inclusion for compressed tree patterns with context variables subject to regular constraints. Context variables with regular constraints permit to properly generalize on unranked tree patterns with hedge variables. Regular inclusion on unranked tree patterns is relevant to certain query answering on Xml streams with references. We show that regular matching and inclusion with regular constraints can be reduced in polynomial time to the corresponding problem without regular constraints.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|