On the representation of dependencies by propositional logic
MFDBS 91 Proceedings of the 3rd symposium on Mathematical fundamentals of database and knowledge base systems
Normalization and hierarchical dependencies in the relational data model
ACM Transactions on Database Systems (TODS)
Multivalued dependencies and a new normal form for relational databases
ACM Transactions on Database Systems (TODS)
On the menbership problem for functional and multivalued dependencies in relational databases
ACM Transactions on Database Systems (TODS)
An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic
Journal of the ACM (JACM)
Horn clauses and database dependencies
Journal of the ACM (JACM)
A relational model of data for large shared data banks
Communications of the ACM
A complete axiomatization for functional and multivalued dependencies in database relations
SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
Entity-Relationship Modeling: Foundations of Database Technology
Entity-Relationship Modeling: Foundations of 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)
Full hierarchical dependencies in fixed and undetermined universes
Annals of Mathematics and Artificial Intelligence
XML schema refinement through redundancy detection and normalization
The VLDB Journal — The International Journal on Very Large Data 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)
Functional dependencies in a relational database and propositional logic
IBM Journal of Research and Development
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
Appropriate reasoning about data dependencies in fixed and undetermined universes
FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
Elements of Finite Model Theory
Elements of Finite Model Theory
Axiomatising functional dependencies for XML with frequencies
FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
| Hi-index | 0.00 |
Database design aims to find a database schema that permits the efficient processing of common types of queries and updates on future database instances. Full first-order decompositions constitute a large class of database constraints that can provide assistance to the database designer in identifying a suitable database schema. We establish a finite axiomatisation of full first-order decompositions that reflects best database design practice: an inference engine derives all potential candidates of a database schema, but the final choice remains with the database designer.