Computational problems related to the design of normal form relational schemas
ACM Transactions on Database Systems (TODS)
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
ACM SIGMOD Record
A Web odyssey: from codd to XML
ACM SIGMOD Record
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
On the equivalence between FDs in XML and FDs in relations
Acta Informatica
XML schema refinement through redundancy detection and normalization
The VLDB Journal — The International Journal on Very Large Data Bases
Functional dependencies in a relational database and propositional logic
IBM Journal of Research and Development
Efficient reasoning about XFDs with pre-image semantics
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
A Concise Introduction to Mathematical Logic
A Concise Introduction to Mathematical Logic
Characterization of the interaction of XML functional dependencies with DTDs
ICDT'07 Proceedings of the 11th international conference on Database Theory
Axiomatising functional dependencies for XML with frequencies
FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
Attribute grammar for XML integrity constraint validation
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part I
When conceptual model meets grammar: A dual approach to XML data modeling
Data & Knowledge Engineering
Appropriate inferences of data dependencies in relational databases
Annals of Mathematics and Artificial Intelligence
Functional dependencies on extended relations defined by regular languages
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
On Inferences of Full First-Order Hierarchical Decompositions
Fundamenta Informaticae - Logic, Language, Information and Computation
Transactions on Large-Scale Data- and Knowledge-Centered Systems VI
Efficiency frontiers of XML cardinality constraints
Data & Knowledge Engineering
Hi-index | 0.00 |
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.