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)
On the desirability of &ggr;-acyclic BCNF database schemes
Theoretical Computer Science - First International Conference on Database Theory, Rome, September 1986
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)
Testing satisfaction of functional dependencies
Journal of the ACM (JACM)
Updating a relational database through a universal schema interface
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
Efficient query answering in the representative instance approach
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
A relational model of data for large shared data banks
Communications of the ACM
Can we use the universal instance assumption without using nulls?
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Reflections on Boyce-Codd Normal Form
VLDB '82 Proceedings of the 8th International Conference on Very Large Data Bases
Theory of Relational Databases
Theory of Relational Databases
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 maintainability: a generalization of independence
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |
The maintenance problem (for database states) of a database scheme R with respect to a set of functional dependencies F is the following decision problem. Let r be a consistent state of R with respect to F and assume we insert a tuple t into rp &egr; r. Is r ∪ {t} a consistent state of R with respect to F? R is said to be constant-time-maintainable with respect to F if there is an algorithm that solves the maintenance problem of R with respect to F in time independent of the state size.A characterization of constant-time-maintainability for the class of BCNF database schemes is given. An efficient algorithm that tests this characterization is shown, as well as an algorithm for solving the maintenance problem in time independent of the state size. It is also proven that constant-time-maintainable BCNF database schemes are bounded. In particular, it is shown that total projections of the representative instance can be computed via unions of projections of extension joins. Throughout we assume that database schemes are cover embedding and BCNF, and that functional dependencies are given in the form of key dependencies.