The structure of the relational database model
The structure of the relational database model
On the satisfiability of dependency constraints in entity-relationship schemata
Information Systems
Reasoning about functional dependencies generalized for semantic data models
ACM Transactions on Database Systems (TODS)
Cardinality constraints in semantic data models
Data & Knowledge Engineering
Proceedings of the 30th IEEE symposium on Foundations of computer science
On the feasibility of checking temporal integrity constraints
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
Object normal forms and dependency constraints for object-oriented schemata
ACM Transactions on Database Systems (TODS)
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)
Decomposition of object-oriented database schemas
Annals of Mathematics and Artificial Intelligence
On the implication problem for cardinality constraints and functional dependencies
Annals of Mathematics and Artificial Intelligence
ACM SIGMOD Record
Extending Existing Dependency Theory to Temporal Databases
IEEE Transactions on Knowledge and Data Engineering
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
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)
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
XML Queries and constraints, containment and reformulation
Theoretical Computer Science - Database theory
Propagating XML constraints to relations
Journal of Computer and System Sciences
On the equivalence between FDs in XML and FDs in relations
Acta Informatica
Journal of Computer and System Sciences
Graphs, Networks and Algorithms
Graphs, Networks and Algorithms
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
Consistent query answering: five easy pieces
ICDT'07 Proceedings of the 11th international conference on Database Theory
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
Spoilt for Choice: Full First-Order Hierarchical Decompositions
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Constraint acquisition for Entity-Relationship models
Data & Knowledge Engineering
Numerical constraints on XML data
Information and Computation
When data dependencies over SQL tables meet the logics of paradox and S-3
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Armstrong axioms and Boyce-Codd-Heath Normal Form under bag semantics
Information Processing Letters
Faceoff: surrogate vs. natural keys
ADBIS'10 Proceedings of the 14th east European conference on Advances in databases and information systems
On the role of the complementation rule for data dependencies over incomplete relations
WoLLIC'10 Proceedings of the 17th international conference on Logic, language, information and computation
Promoting the semantic capability of XML keys
XSym'10 Proceedings of the 7th international XML database conference on Database and XML technologies
The boyce-codd-heath normal form for SQL
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
A precious class of cardinality constraints for flexible XML data processing
ER'11 Proceedings of the 30th international conference on Conceptual modeling
Design by example for SQL table definitions with functional dependencies
The VLDB Journal — The International Journal on Very Large Data Bases
Characterisations of multivalued dependency implication over undetermined universes
Journal of Computer and System Sciences
Some remarks on relational database schemes having few minimal keys
Conceptual Modelling and Its Theoretical Foundations
Foundations for a fourth normal form over SQL-Like databases
Conceptual Modelling and Its Theoretical Foundations
Transforming geometrically enhanced conceptual model schemas to GML
Conceptual Modelling and Its Theoretical Foundations
ACM Transactions on Database Systems (TODS)
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
Repairing XML functional dependency violations
Information Sciences: an International Journal
On Inferences of Full First-Order Hierarchical Decompositions
Fundamenta Informaticae - Logic, Language, Information and Computation
On Inferences ofWeak Multivalued Dependencies
Fundamenta Informaticae
XML data exchange with target constraints
Information Processing and Management: an International Journal
Reasoning about functional and full hierarchical dependencies over partial relations
Information Sciences: an International Journal
Discovering XSD keys from XML data
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
APCCM '12 Proceedings of the Eighth Asia-Pacific Conference on Conceptual Modelling - Volume 130
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 demonstrate that: (1) one of the proposed inference rules is not sound in general, and (2) the inference rules are incomplete for XML key implication, even for nonempty sets of simple key paths. This shows, in contrast to earlier statements, that the axiomatizability of XML keys is still open, and efficient algorithms for deciding their implication still need to be developed. Solutions to these problems have a wide range of applications including consistency validation, XML schema design, data exchange and integration, consistent query answering, XML query optimization and rewriting, and indexing. In this article, we investigate the axiomatizability and implication problem for XML keys with nonempty sets of simple key paths. In particular, we propose a set of inference rules that is indeed sound and complete for the implication of such XML keys. We demonstrate that this fragment is robust by showing the duality of XML key implication to the reachability problem of fixed nodes in a suitable digraph. This enables us to develop a quadratic-time algorithm for deciding implication, and shows that reasoning about this XML key fragment is practically efficient. Therefore, XML applications can be unlocked effectively since they benefit not only from those XML keys specified explicitly by the data designer but also from those that are specified implicitly.