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.

中文翻译：

---

定期匹配和列入压缩树模式与约束的环境变量

我们研究常规匹配压缩树模式与上下文变量定期进行制约的复杂性和包容性。与普通约束的环境变量允许对未排序树模式与对冲变量正确一概而论。对未排序树模式经常夹杂相关某些查询应答上的Xml与引用流。我们发现，定期匹配和包容定期约束可以在多项式时间内还原成相应的问题，而无需常规的约束。