joint work with Thomas Schwentick

I will introduce a framework for XML integrity constraints. An
XML-to-relational constraint consists of a mapping m, that maps trees to relations and a relational integrity constraint. We will have a look on
the complexity of the implication problem in the case where the mapping is based on tree patterns (of various kinds) and the relational
constraints are functional dependencies.