Finitely Specifiable Implicational Dependency Families
Journal of the ACM (JACM)
A simplied universal relation assumption and its properties
ACM Transactions on Database Systems (TODS)
Maximal objects and the semantics of universal relation databases
ACM Transactions on Database Systems (TODS)
The theory of joins in relational databases
ACM Transactions on Database Systems (TODS)
Efficient optimization of a class of relational expressions
ACM Transactions on Database Systems (TODS)
Testing implications of data dependencies
ACM Transactions on Database Systems (TODS)
Construction of relations in relational databases
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)
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
Specifying connections for a universal relation scheme database
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
Toward logical data independence: a relational query language without relations
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
A universal relation database system implemented via the network model
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
Satisfying database states
Theory of Relational Databases
Theory of Relational Databases
SYSTEM/U: a database system based on the universal relation assumption
ACM Transactions on Database Systems (TODS)
Database states and their tableaux
ACM Transactions on Database Systems (TODS)
On Kent's “Consequences of assuming a universal relation” (Technical correspondance)
ACM Transactions on Database Systems (TODS)
Degrees of acyclicity for hypergraphs and relational database schemes
Journal of the ACM (JACM)
On the complexity and axiomatizability of consistent database states
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
On the semantics of updates in databases
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
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
| Hi-index | 0.01 |
Manifestations of the "universal relation assumption" can be seen either as definitions of a one-relation user view of data, or as algorithms for answering queries about arbitrary sets of attributes. In this paper we explore equivalences between these two points of view. We show that if the user's view is the representative instance, then our ability to answer queries about the universal relation, by applying relational algebra to the actual database, is equivalent to a "boundedness" condition on the dependencies of the database scheme. Further, whenever this condition holds, there is a finite union of lossless tableau mappings that produces the desired relation.