On interpretations of relational languages and solutions to the implied constraint problem
ACM Transactions on Database Systems (TODS)
The theory of joins in relational databases
ACM Transactions on Database Systems (TODS)
Testing implications of data dependencies
ACM Transactions on Database Systems (TODS)
An authorization mechanism for a relational database system
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)
Calculating constraints on relational expression
ACM Transactions on Database Systems (TODS)
Testing for the Church-Rosser Property
Journal of the ACM (JACM)
Equivalences Among Relational Expressions with the Union and Difference Operators
Journal of the ACM (JACM)
On the family of generalized dependency constraints
Journal of the ACM (JACM)
A relational model of data for large shared data banks
Communications of the ACM
Implementation of integrity constraints and views by query modification
SIGMOD '75 Proceedings of the 1975 ACM SIGMOD international conference on Management of data
Principles of Database Systems
Principles of Database Systems
Normal forms and relational database operators
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Reasoning about nested functional dependencies
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Locking Expressions for Increased Database Concurrency
Journal of the ACM (JACM)
Incomplete information and dependencies in relational databases
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
Inverting relational expressions: a uniform and natural technique for various database problems
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
First-Order Logic Characterization of Program Properties
IEEE Transactions on Knowledge and Data Engineering
An Equational Chase for Path-Conjunctive Queries, Constraints, and Views
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Interval Queries on Object Histories: Extended Abstract
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
ILOG: Declarative Creation and Manipulation of Object Identifiers
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Composition of mappings given by embedded dependencies
ACM Transactions on Database Systems (TODS)
Propagating XML constraints to relations
Journal of Computer and System Sciences
Semantic optimization techniques for preference queries
Information Systems
Dependencies revisited for improving data quality
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Propagating functional dependencies with conditions
Proceedings of the VLDB Endowment
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
ACM Transactions on Database Systems (TODS)
Appropriate inferences of data dependencies in relational databases
Annals of Mathematics and Artificial Intelligence
A new approach to inferences of semantic constraints
ADBIS'97 Proceedings of the First East-European conference on Advances in Databases and Information systems
Reasoning about functional and full hierarchical dependencies over partial relations
Information Sciences: an International Journal
Value invention in data exchange
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
| Hi-index | 0.00 |
A relational database models some part of the real world by a set of relations and a set of constraints. The constraints model properties of the stored information and must be maintained true at all times. For views defined over physically stored (base) relations, this is done by determining whether the view constraints are logical consequences of base relation constraints. A technique for determining such valid view constraints is presented in this paper. A generalization of the tableau chase is used. The idea of the method is to generate a tableau for the expression whose summary violates the test constraints in a “canonical” way. The chase then tries to remove this violation.It is also shown how this method has applications to schema design. Relations not in normal form or having other deficiencies can be replaced by normal form projections without losing the ability to represent all constraint information.