Update semantics of relational views
ACM Transactions on Database Systems (TODS)
Determining View dependencies using 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)
Principles of Database Systems
Principles of Database Systems
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
A technique for translating states between database schemata
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
On equivalences of database schemes
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Notions of dependency satisfaction
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Horn clauses and database dependencies (Extended Abstract)
STOC '80 Proceedings of the twelfth 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
Incomplete Information in Relational Databases
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
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Multi-RQP: generating test databases for the functional testing of OLTP applications
Proceedings of the 1st international workshop on Testing database systems
| Hi-index | 0.00 |
Let f be a relational expression and let q be a relation. It appears, surprisingly enough, that the concept of the table introduced in order to represent incomplete information can be used as a tool for representing {r f(r) ⊇ q} for a class of relational expressions built up from projection, join and positive selection. This fact, together with some other known properties of tables has wide applications and leads to a new technique for expressing and solving many database problems, especially those concerned with views. This technique is, we believe, more natural and systematic than those previously used such as tableau techniques. Some applications, like view dependencies, translating states between views and the view equivalence problem are presented.