A Proof Procedure for Data Dependencies
Journal of the ACM (JACM)
Design by exmple: An application of Armstrong relations
Journal of Computer and System Sciences
Test data for relational queries
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Reasoning about functional dependencies generalized for semantic data models
ACM Transactions on Database Systems (TODS)
Object normal forms and dependency constraints for object-oriented schemata
ACM Transactions on Database Systems (TODS)
Axiomatisation of functional dependencies in incomplete relations
Theoretical Computer Science
Reasoning about nested functional dependencies
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Temporal FDs on complex objects
ACM Transactions on Database Systems (TODS)
Computational problems related to the design of normal form relational schemas
ACM Transactions on Database Systems (TODS)
Testing implications of data dependencies
ACM Transactions on Database Systems (TODS)
Normalization and hierarchical dependencies in the relational data model
ACM Transactions on Database Systems (TODS)
Synthesizing third normal form relations from functional dependencies
ACM Transactions on Database Systems (TODS)
Multivalued dependencies and a new normal form for 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)
On the Complexity of Testing Implications of Functional and Join Dependencies
Journal of the ACM (JACM)
A Complete Axiomatization of Full Join Dependencies
Journal of the ACM (JACM)
Horn clauses and database dependencies
Journal of the ACM (JACM)
On the family of generalized dependency constraints
Journal of the ACM (JACM)
On the Structure of Armstrong Relations for Functional Dependencies
Journal of the ACM (JACM)
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
A relational model of data for large shared data banks
Communications of the ACM
Synthesizing independent database schemas
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Selected Papers from a Workshop on Semantics in Databases
Analysis and design of relational schemata for database systems.
Analysis and design of relational schemata for database systems.
A normal form for XML documents
ACM Transactions on Database Systems (TODS)
On a problem of Fagin concerning multivalued dependencies in relational databases
Theoretical Computer Science
Semantic sampling of existing databases through informative Armstrong databases
Information Systems
What does Boyce-Codd normal form do?
VLDB '80 Proceedings of the sixth international conference on Very Large Data Bases - Volume 6
Some contributions to the minimum representation problem of key systems
FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
Hi-index | 0.00 |
We identify established tableaux techniques as an invaluable tool for semantic knowledge acquisition in the design process of relational databases. Sample databases allow users and designers to judge, justify, convey and test their understanding of the semantics of the future database. In the case of integrity constraints such sample data can provide considerable assistance for deciding whether a constraint captures desirable information about the database or not. Since constraints can be particularly difficult to grasp in practice sample databases offer a convenient tool to confirm or reject the usefulness of potential candidate constraints. We pinpoint the Chase and analytical tableau as two tableaux techniques that are able to automatically generate sample databases for large classes of integrity constraints. The Chase can be used for generating sample data that allows us to reject candidate constraints. However, analytical tableaux enable us to find all minimal sample databases which enable us to either accept or reject a candidate constraint.