A simplied universal relation assumption and its properties

@article{Fagin1982ASU,
  title={A simplied universal relation assumption and its properties},
  author={Ronald Fagin and Alberto O. Mendelzon and Jeffrey D. Ullman},
  journal={ACM Trans. Database Syst.},
  year={1982},
  volume={7},
  pages={343-360}
}
One problem concerning the universal relation assumption is the inability of known methods to obtain a database scheme design in the general case, where the real-world constraints are given by a set of dependencies that includes embedded multivalued dependencies. We propose a simpler method of describing the real world, where constraints are given by functional dependencies and a single join dependency. The relationship between this method of defining the real world and the classical methods is… Expand
Properties of acyclic database schemes
TLDR
The purpose of this paper is to define the class formally, to give its important properties and the equivalences with the other classes mentioned, and to explain the importance of each property. Expand
Database states and their tableaux
TLDR
This work proposes the set of all weak instances for a state as an embodiment of the information represented by the state and characterize states that have the same set of weak instances by the equivalence of their associated tableaux. Expand
Maximal objects and the semantics of universal relation databases
The universal relation concept is intended to provide the database user with a simplified model in which he can compose queries without regard to the underlying structure of the relations in theExpand
The revenge of the JD
TLDR
If the user's view is the representative instance, then the 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. Expand
Can we use the universal instance assumption without using nulls?
We claim that the representative instance of [Ho1, Va3] is a correct representation of the data stored in a database even when the relations of the database are not the projections of a singleExpand
One flavor assumption and gamma-acyclicity for universal relation views
TLDR
A deep connection is proved between database schemes satisfying the One Flavor Assumption and y-acyclic schemes and the essence of join paths which are used in the universal relation system DURST are defined. Expand
The Equivalence of Universal Relation Definitions.
Abstract : The universal relation model aims at achieving complete access path independence by relieving the user of the need for logical navigation among relations. It assumes that for every set ofExpand
Representative instances and γ-acyclic relational schemes
  • S. Jajodia, P. Ng
  • Computer Science
  • IEEE Transactions on Software Engineering
  • 1984
TLDR
It is shown that L would actually be a representative instance under a set of functional dependencies if R satisfies the additional mild condition: for any functional dependency X → A where A is a single attribute, whenever XA is contained in two relation schemes R and R' of R it follows that R ∩R' is a relation scheme of R, having X as one of its keys. Expand
Acyclic Join Dependency and Data Base Projections
  • R. Hull
  • Computer Science, Mathematics
  • J. Comput. Syst. Sci.
  • 1983
TLDR
A new characterization of acyclic join dependency, based on “structured edge-trees,” is given and is used to obtain a variety of results on acy Cleric join dependency and a modification of the Graham reduction process. Expand
A characterization of globally consistent databases and their correct access paths
TLDR
The representative instance is proposed as a representation of the data stored in a database whose relations are not the projections of a universal instance, provided that local consistency implies global consistency. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 42 REFERENCES
On the menbership problem for functional and multivalued dependencies in relational databases
The problem of whether a given dependency in a database relation can be derived from a given set of dependencies is investigated. We show that the problem can be decided in polynomial time when theExpand
Multivalued dependencies and a new normal form for relational databases
TLDR
It is shown that every relation schema can be decomposed into a family of relation schemata in fourth normal form without loss of information (that is, the original relation can be obtained from the new relations by taking joins). Expand
Equivalence of relational database schemes
TLDR
It is argued that this question reduces to the equivalence of the sets of fixed points of the project-join mappings associated with the two database schemes in question, and the “update sets” approach to database design is introduced. Expand
Equivalence of Relational Database Schemes
TLDR
It is argued that this question reduces to the equivalence of the sets of fixed points of the project-join mappings associated with the two database schemes in question, and the “update sets” approach to database design is introduced. Expand
A Sophisticate's Introduction to Database Normalization Theory
TLDR
This paper is intended to serve the two-fold purpose of introducing the main issues and theorems of formal database semantics to the uninitiated, and to clarify the terminology of the field. Expand
A complete axiomatization for functional and multivalued dependencies in database relations
TLDR
The main result of the paper is that the rules presented are complete for the family of functional and multivalued dependencies. Expand
Generalized Mutual Dependencies And The Decomposition Of Database Relations
  • A. Mendelzon, D. Maier
  • Computer Science
  • Fifth International Conference on Very Large Data Bases, 1979.
  • 1979
TLDR
This work shows that a generalized mutual dependency, together with a set of multivalued dependencies, provide a necessary and sufficient condition for a relation to be decomposable in the general case. Expand
Synthesizing third normal form relations from functional dependencies
TLDR
An effective procedure for performing a relational scheme synthesis is presented and the schema that results from this procedure is proved to be in Codd's third normal form and to contain the fewest possible number of relations. Expand
Real-world MVD's
TLDR
This paper investigates how much complexity is actually needed in real-world situations by showing that every "natural" set of mvd's must belong to a class of m DVD's called conflict-free, and it is shown that adding semantic concepts amounts to making the set ofmvd's conflict- free. Expand
Testing implications of data dependencies
TLDR
The chase can be used to test equivalence of database schemes and as part of the test of whether the relation schemes in a database scheme are independent components. Expand
...
1
2
3
4
5
...