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
Independent and separable database schemes
SIAM Journal on Computing
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
Evaluation of queries in independent database schemes
Journal of the ACM (JACM)
Independence-reducible database schemes
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
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)
Computational problems related to the design of normal form relational schemas
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)
Synthesizing third normal form relations from functional dependencies
ACM Transactions on Database Systems (TODS)
Testing satisfaction of functional dependencies
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
Principles of Database Systems
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
A formal treatment of imperfect information in database management
A formal treatment of imperfect information in database management
Hi-index | 0.00 |
We define the independence-reducibility based on a modification of key dependencies, which has better computational properties and is more practically useful than the original one based on key dependencies. Using this modification as a tool, we design BCNF databases that are highly desirable with respect to updates and/or query answering. In particular, given a set U of attributes and a set F of functional dependencies over U, we characterize when F can be embedded in a database scheme over U that is independent and is BCNF with respect to F, a polynomial time algorithm that tests this characterization and produces such a database scheme whenever possible is presented. The produced database scheme contains the fewest possible number of relation schemes. Then we show that designs of embedding constant-time-maintainable BCNF schemes and of embedding independence-reducible schemes share exactly the same method with the above design. Finally, a simple modification of this method yields a polynomial time algorithm for designing embedding separable BCNF schemes.