Notions of dependency satisfaction
Journal of the ACM (JACM) - The MIT Press scientific computation series
Constant time maintenance or the triumph of the FD.
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
On bounded database schemes and bounded Horn-clause programs
SIAM Journal on Computing
Database states and their tableaux
ACM Transactions on Database Systems (TODS)
On the foundations of the universal relation model
ACM Transactions on Database Systems (TODS)
A characterization of globally consistent databases and their correct access paths
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)
Testing satisfaction of functional dependencies
Journal of the ACM (JACM)
Degrees of acyclicity for hypergraphs and relational database schemes
Journal of the ACM (JACM)
Efficient query answering in the representative instance approach
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
Can we use the universal instance assumption without using nulls?
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Optimal computation of total projections with unions of simple chase join expressions
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
A characterization of constant-time maintainability for BCNF database schemes
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Can constant-time-maintainability be more practical?
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)
Constant-time maintainability: a generalization of independence
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |
A class of cover embedding database schemes, called independence-reducible, is proposed and is proven to be bounded and algebraic-maintainable, and therefore is highly desirable with respect to query answering and constraint enforcement. This class of schemes is shown to properly contain a superset of all previously known classes of cover embedding BCNF database schemes which are bounded (and constant-time-maintainable). An efficient algorithm is found which recognizes exactly this class of database schemes. Independence-reducible database schemes properly contain a class of constant-time-maintainable database schemes and a condition which characterizes this class of schemes is found, this condition can be tested efficiently. Throughout, it is assumed that a cover of the functional dependencies is embedded in the database scheme in the form of key dependencies.