Consequences of assuming a universal relation
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)
The entity-relationship model—toward a unified view of data
ACM Transactions on Database Systems (TODS) - Special issue: papers from the international conference on very large data bases: September 22–24, 1975, Framingham, MA
The design and implementation of INGRES
ACM Transactions on Database Systems (TODS)
Decomposition—a strategy for query processing
ACM Transactions on Database Systems (TODS)
Synthesizing third normal form relations from functional dependencies
ACM Transactions on Database Systems (TODS)
Equivalences Among Relational Expressions with the Union and Difference Operators
Journal of the ACM (JACM)
On the Equivalence of Database Models
Journal of the ACM (JACM)
Testing satisfaction of functional dependencies
Journal of the ACM (JACM)
A relational model of data for large shared data banks
Communications of the ACM
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
Properties of acyclic database schemes
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
On the properties and characterization of connection-trap-free schemes
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Efficient optimization of simple chase join expressions
ACM Transactions on Database Systems (TODS)
View updates in relational databases with an independent scheme
ACM Transactions on Database Systems (TODS)
Ad Hoc Query: a reusable database access capability
WADAS '94 Proceedings of the eleventh annual Washington Ada symposium & summer ACM SIGAda meeting on Ada
On the foundations of the universal relation model
ACM Transactions on Database Systems (TODS)
Tree queries: a simple class of relational queries
ACM Transactions on Database Systems (TODS)
On Kent's “Consequences of assuming a universal relation” (Technical correspondance)
ACM Transactions on Database Systems (TODS)
The universal relation revisited (technical correspondence)
ACM Transactions on Database Systems (TODS)
Degrees of acyclicity for hypergraphs and relational database schemes
Journal of the ACM (JACM)
Syntactic Characterization of Tree Database Schemas
Journal of the ACM (JACM)
MAYBE algebra operators in database machine architecture
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
ELFS: English language from SQL
ACM Transactions on Database Systems (TODS)
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
Dependency characterizations for acyclic database schemes
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Assumptions in relational database theory
PODS '82 Proceedings of the 1st 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
Tableau Techniques for Querying Information Sources through Global Schemas
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Generating Relations from XML Documents
ICDT '03 Proceedings of the 9th International Conference on Database Theory
LAURA: A Formal Data Model and her Logical Design Methodology
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Database Decomposition into Fourth Normal Form
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Universal Relation Views: A Pragmatic Approach
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Select-Project Queries over XML Documents
NGITS '02 Proceedings of the 5th International Workshop on Next Generation Information Technologies and Systems
A Model for Contextual Cooperative Query Answering in E-Commerce Applications
FQAS '09 Proceedings of the 8th International Conference on Flexible Query Answering Systems
| Hi-index | 0.00 |
In this paper, we try to put to rest many of the objections to the universal relation concept that have appeared in the literature. First, we shall taxonomize the varieties of ideas that are sometimes called the "universal relation assumption." Then, we consider some of the arguments pro and con. In some cases, the arguments against were expressed prematurely, and solutions to the problems they expose have since been found. In other cases, the arguments against are simply fallacious. In still other cases, the problems pointed out are real, but simply serve to point out that the advantages of the universal relation are not gotten for free. We shall conclude the paper with a description of the algorithm used to interpret queries in System/U, and the reasoning behind it.