A Proof Procedure for Data Dependencies
Journal of the ACM (JACM)
Database states and their tableaux
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)
On the Complexity of Testing Implications of Functional and Join Dependencies
Journal of the ACM (JACM)
Testing satisfaction of functional dependencies
Journal of the ACM (JACM)
Horn clauses and database dependencies
Journal of the ACM (JACM)
First order logic formalization for functional, multivalued and mutual dependencies
SIGMOD '78 Proceedings of the 1978 ACM SIGMOD international conference on management of data
Logic and Data Bases
Can we use the universal instance assumption without using nulls?
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
On the complexity and axiomatizability of consistent database states
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Independent and separable database schemes
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
The inference problem for template dependencies
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
The Implication Problem for Data Dependencies
Proceedings of the 8th Colloquium on Automata, Languages and Programming
Embedded implicational dependencies and their inference problem
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
A formal treatment of imperfect information in database management
A formal treatment of imperfect information in database management
Constant time maintenance or the triumph of the FD.
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
On the integrity of databases with incomplete information
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Answering queries on embedded-complete database schemes
Journal of the ACM (JACM)
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A new basis for the weak instance model
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A characterization of constant-time maintainability for BCNF database schemes
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Horn tables-an efficient tool for handling incomplete information in databases
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Polynomial time designs toward both BCNF and efficient data manipulation
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Constant-time-maintainable BCNF database schemes
ACM Transactions on Database Systems (TODS)
Independence-reducible database schemes
Journal of the ACM (JACM)
Constant-time maintainability: a generalization of independence
ACM Transactions on Database Systems (TODS)
Semantics for null extended nested relations
ACM Transactions on Database Systems (TODS)
Regular Article: The nested universal relation data model
Proceedings of the 30th IEEE symposium on Foundations of computer science
Independence-reducible database schemes
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Journal of Computer and System Sciences
| Hi-index | 0.00 |
Two notions of dependency satisfaction, consistency and completeness, are introduced. Consistency is the natural generalization of weak-instance satisfaction and seems appropriate when only equality-generating dependencies are given, but disagrees with the standard notion in the presence of tuple-generating dependencies. Completeness is based on the intuitive semantics of tuple-generating dependencies but differs from the standard notion for equality-generating dependencies. It is argued that neither approach is the correct one, but rather that they correspond to different policies on constraint enforcement, and each one is appropriate in different circumstances. Consistency and completeness of a state are characterized in terms of the tableau associated with the state and in terms of logical properties of a set of first-order sentences associated with the state. A close relation between the problems of testing for consistency and completeness and of testing implication of dependencies is established, leading to lower and upper bounds for the complexity of consistency and completeness. The possibility of formalizing dependency satisfaction without using a universal relation scheme is examined.