Designing Functional Dependencies for XML
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
A normal form for XML documents
ACM Transactions on Database Systems (TODS)
Strong functional dependencies and their application to normal forms in XML
ACM Transactions on Database Systems (TODS)
Removing XML data redundancies using functional and equality-generating dependencies
ADC '05 Proceedings of the 16th Australasian database conference - Volume 39
A comparative study of functional dependencies for XML
APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development
Axiomatising functional dependencies for XML with frequencies
FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
Know your limits: enhanced XML modeling with cardinality constraints
ER '07 Tutorials, posters, panels and industrial contributions at the 26th international conference on Conceptual modeling - Volume 83
Boolean Constraints for XML Modeling
Proceedings of the 2009 conference on Information Modelling and Knowledge Bases XX
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
Using transversals for discovering XML functional dependencies
FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
Solving the implication problem for XML functional dependencies with properties
WoLLIC'10 Proceedings of the 17th international conference on Logic, language, information and computation
The implication problem for 'closest node' functional dependencies in complete XML documents
Journal of Computer and System Sciences
Hi-index | 0.00 |
The study of integrity constraints has been identified as one of the major challenges in XML database research. The main difficulty is finding a balance between the expressiveness and the existence of automated reasoning tools. We investigate a previous proposal for functional dependencies in XML (XFDs) that is based on homomorphisms between data trees and schema trees. We demonstrate that reasoning about our XFDs is well-founded. We provide a finite axiomatisation and show that their implication is equivalent to the logical implication of propositional Horn clauses and thus decidable in time linear in the size of the constraints. Hence, our XFDs do not only capture valuable semantic information but also permit efficient automated reasoning support.