Solving the implication problem for XML functional dependencies with properties

  • Authors:
  • Sven Hartmann;Sebastian Link;Thu Trinh

  • Affiliations:
  • Clausthal University of Technology, Germany;Victoria University of Wellington, New Zealand;Clausthal University of Technology, Germany

  • Venue:
  • WoLLIC'10 Proceedings of the 17th international conference on Logic, language, information and computation
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.