The structure of the relational database model
The structure of the relational database model
Reasoning about nested functional dependencies
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Path constraints in semistructured databases
Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
Constraints for semistructured data and XML
ACM SIGMOD Record
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
On XML integrity constraints in the presence of DTDs
Journal of the ACM (JACM)
ACM SIGMOD Record
Containment for XPath Fragments under DTD Constraints
ICDT '03 Proceedings of the 9th International Conference on Database Theory
The Theory of Data Dependencies - An Overview
Proceedings of the 11th Colloquium on Automata, Languages and Programming
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
XPath Containment in the Presence of Disjunction, DTDs, and Variables
ICDT '03 Proceedings of the 9th International Conference on Database Theory
A Web odyssey: from codd to XML
ACM SIGMOD Record
Journal of Computer and System Sciences - Special issue on PODS 2000
Information Systems
Containment and equivalence for a fragment of XPath
Journal of the ACM (JACM)
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)
Multi-valued dependencies in the presence of lists
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
An information-theoretic approach to normal forms for relational and XML data
Journal of the ACM (JACM)
Efficient algorithms for processing XPath queries
ACM Transactions on Database Systems (TODS)
Structural properties of XPath fragments
Theoretical Computer Science - Database theory
Graphs, Networks and Algorithms
Graphs, Networks and Algorithms
Axiomatising functional dependencies for XML with frequencies
FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
Journal of Computer and System Sciences
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
Semantics in Data and Knowledge Bases
Expressive, yet tractable XML keys
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Efficient reasoning about a robust XML key fragment
ACM Transactions on Database Systems (TODS)
Regular tree patterns: a uniform formalism for update queries and functional dependencies in XML
Proceedings of the 2010 EDBT/ICDT Workshops
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
Consistent query answers from virtually integrated XML data
Journal of Systems and Software
Fast detection of functional dependencies in XML data
XSym'10 Proceedings of the 7th international XML database conference on Database and XML technologies
Promoting the semantic capability of XML keys
XSym'10 Proceedings of the 7th international XML database conference on Database and XML technologies
On Inferences of Full First-Order Hierarchical Decompositions
Fundamenta Informaticae - Logic, Language, Information and Computation
Efficiency frontiers of XML cardinality constraints
Data & Knowledge Engineering
| Hi-index | 0.00 |
We review key constraints in the context of XML as introduced by Buneman et al. We show that one of the proposed inference rules is not sound in general, and the axiomatisation proposed for XML keys is incomplete even if key paths are simple. Therefore, the axiomatisation and also the implication problem for XML keys are still unsolved. We propose a set of inference rules that is indeed sound and complete for the implication of XML keys with simple key paths. Our completeness proof enables us to characterise the implication of XML keys in terms of the reachability problem of nodes in a digraph. This results in a quadratic time algorithm for deciding XML key implication, and shows that reasoning for XML keys is practically efficient.