Due to the complex nature of XML, finding classes of integrity constraints for XML data that are both expressive and practical is an important but challenging task. In this paper, we study a class of XML functional dependencies (called pXFDs) defined on the basis of tree homomorphism. We establish a semantic equivalence between the implications problems for pXFDs and for propositional Horn clauses, which guarantees linear time decidability of pXFD implication. Hence, pXFDs cannot only be used to capture relevant data semantics, but also be reasoned about efficiently. © 2010 Springer-Verlag.
CITATION STYLE
Hartmann, S., Link, S., & Trinh, T. (2010). Solving the implication problem for XML functional dependencies with properties. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6188 LNAI, pp. 161–175). https://doi.org/10.1007/978-3-642-13824-9_14
Mendeley helps you to discover research relevant for your work.