Maximal Objects and the Semantics of Universal Relation Databases.
David Maier, Jeffrey D. Ullman:
Maximal Objects and the Semantics of Universal Relation Databases.
ACM Trans. Database Syst. 8(1): 1-14(1983)@article{DBLP:journals/tods/MaierU83,
author = {David Maier and
Jeffrey D. Ullman},
title = {Maximal Objects and the Semantics of Universal Relation Databases},
journal = {ACM Trans. Database Syst.},
volume = {8},
number = {1},
year = {1983},
pages = {1-14},
ee = {http://doi.acm.org/10.1145/319830.319831, db/journals/tods/MaierU83.html},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX
Abstract
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 the database. Frequently, the lossless join criterion
provides the query interpreter with the clue needed to interpret the query as the
user intended. However, some examples exist where interpretation by the lossless-join
rule runs contrary to our intuition. To handle some of these cases, we propose a
concept called maximal objects, which modifies the universal relation concept in
exactly those situations where it appears to go awry - when the underlying relational
structure has "cycles." We offer examples of how the maximal object concept provides
intuitively correct interpretations. We also consider how one might construct maximal
objects mechanically from purely syntactic structural information - the relation
schemes and functional dependencies - about the database.
Copyright © 1983 by the ACM,
Inc., used by permission. Permission to make
digital or hard copies is granted provided that
copies are not made or distributed for profit or
direct commercial advantage, and that copies show
this notice on the first page or initial screen of
a display along with the full citation.
CDROM Version: Load the CDROM "Volume 3 Issue 1, TODS 1976-1990" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 2" and ...
BibTeX
References
- [1]
- ...
- [2]
- Alfred V. Aho, Catriel Beeri, Jeffrey D. Ullman:
The Theory of Joins in Relational Databases.
ACM Trans. Database Syst. 4(3): 297-314(1979) BibTeX
- [3]
- Alfred V. Aho, Yehoshua Sagiv, Jeffrey D. Ullman:
Efficient Optimization of a Class of Relational Expressions.
ACM Trans. Database Syst. 4(4): 435-454(1979) BibTeX
- [4]
- Paolo Atzeni, Douglas Stott Parker Jr.:
Assumptions in Relational Database Theory.
PODS 1982: 1-9 BibTeX
- [5]
- Catriel Beeri, Ronald Fagin, David Maier, Mihalis Yannakakis:
On the Desirability of Acyclic Database Schemes.
J. ACM 30(3): 479-513(1983) BibTeX
- [6]
- Philip A. Bernstein, Nathan Goodman:
What does Boyce-Codd Normal Form Do?
VLDB 1980: 245-259 BibTeX
- [7]
- E. F. Codd:
Extending the Database Relational Model to Capture More Meaning.
ACM Trans. Database Syst. 4(4): 397-434(1979) BibTeX
- [8]
- Ronald Fagin, Alberto O. Mendelzon, Jeffrey D. Ullman:
A Simplified Universal Relation Assumption and Its Properties.
ACM Trans. Database Syst. 7(3): 343-360(1982) BibTeX
- [9]
- Peter Honeyman, Richard E. Ladner, Mihalis Yannakakis:
Testing the Universal Instance Assumption.
Inf. Process. Lett. 10(1): 14-19(1980) BibTeX
- [10]
- William Kent:
Consequences of Assuming a Universal Relation.
ACM Trans. Database Syst. 6(4): 539-556(1981) BibTeX
- [11]
- ...
- [12]
- ...
- [13]
- David Maier:
The Theory of Relational Databases.
Computer Science Press 1983, ISBN 0-914894-42-0
Contents BibTeX
- [14]
- David Maier, Alberto O. Mendelzon, Yehoshua Sagiv:
Testing Implications of Data Dependencies.
ACM Trans. Database Syst. 4(4): 455-469(1979) BibTeX
- [15]
- David Maier, Yehoshua Sagiv, Mihalis Yannakakis:
On the Complexity of Testing Implications of Functional and Join Dependencies.
J. ACM 28(4): 680-695(1981) BibTeX
- [16]
- David Maier, Jeffrey D. Ullman:
Connections in Acyclic Hypergraphs.
PODS 1982: 34-39 BibTeX
- [17]
- Yehoshua Sagiv:
Can We Use the Universal Instance Assumption Without Using Nulls?
SIGMOD Conference 1981: 108-120 BibTeX
- [18]
- ...
- [19]
- Michael Stonebraker, Eugene Wong, Peter Kreps, Gerald Held:
The Design and Implementation of INGRES.
ACM Trans. Database Syst. 1(3): 189-222(1976) BibTeX
- [20]
- Jeffrey D. Ullman:
Principles of Database Systems, 2nd Edition.
Computer Science Press 1982, ISBN 0-914894-36-6
BibTeX
Referenced by
- Hasan Davulcu, Juliana Freire, Michael Kifer, I. V. Ramakrishnan:
A Layered Architecture for Querying Dynamic Web Content.
SIGMOD Conference 1999: 491-502
- Ashish Mehta, James Geller, Yehoshua Perl, Erich J. Neuhold:
The OODB Path-Method Generator (PMG) Using Access Weights and Precomputed Access Relevance.
VLDB J. 7(1): 25-47(1998)
- Antonio Massari, Stefano Pavani, Lorenzo Saladini, Panos K. Chrysanthis:
QBI: Query By Icons.
SIGMOD Conference 1995: 477
- J. Leon Zhao, Arie Segev, Abhirup Chatterjee:
A Universal Relation Approach to Federated Database Management.
ICDE 1995: 261-270
- Amihai Motro:
Intensional Answers to Database Queries.
IEEE Trans. Knowl. Data Eng. 6(3): 444-454(1994)
- Tzy-Hey Chang, Edward Sciore:
A Universal Relation Data Model with Semantic Abstraction.
IEEE Trans. Knowl. Data Eng. 4(1): 23-33(1992)
- Heikki Hyötyniemi, Aarno Lehtola:
A Universal Relation Database Interface for Knowledge Based Systems.
DASFAA 1991: 84-88
- Joseph A. Wald, Paul G. Sorenson:
Explaining Ambiguity in a Formal Query Language.
ACM Trans. Database Syst. 15(2): 125-161(1990)
- Amihai Motro:
FLEX: A Tolerant and Cooperative User Interface to Databases.
IEEE Trans. Knowl. Data Eng. 2(2): 231-246(1990)
- Kyu-Young Whang, Ashok Malhotra, Gary H. Sockut, Luanne M. Burns:
Supporting Universal Quantification in a Two-Dimensional Database Query Language.
ICDE 1990: 68-75
- David W. Embley:
NFQL: The Natural Forms Query Language.
ACM Trans. Database Syst. 14(2): 168-211(1989)
- Michel Kuntz, Rainer Melchert:
Pasta-3's Graphical Query Language: Direct Manipulation, Cooperative Queries, Full Expressive Power.
VLDB 1989: 97-105
- Lev A. Tenenbaum:
Blocks and Projections' Synthesis in relational Databases.
MFDBS 1989: 367-381
- Victor M. Markowitz, Arie Shoshani:
Abbreviated Query Interpretation in Extended Entity-Relationship Oriented Databases.
ER 1989: 325-343
- Jeffrey D. Ullman:
Principles of Database and Knowledge-Base Systems, Volume II.
Computer Science Press 1989, ISBN 0-7167-8162-X
Contents - Volkert Brosda, Gottfried Vossen:
Update and Retrieval in a Relational Database Through a Universal Schema Interface.
ACM Trans. Database Syst. 13(4): 449-485(1988)
- Erich J. Neuhold, Michael Schrefl:
Dynamic Derivation of Personalized Views.
VLDB 1988: 183-194
- Edward P. F. Chan, Paolo Atzeni:
On the Properties and Characterization of Connection-tap-free Schemes.
PODS 1986: 140-147
- Scott M. Staley, David C. Anderson:
Executable E-R Specifications for Database Schema Design.
ER 1985: 160-169
- Ashok Pahwa, Adarsh K. Arora:
Automatic Database Navigation: Towards a High Level User Interface.
ER 1985: 36-43
- Joseph A. Wald, Paul G. Sorenson:
Resolving the Query Inference Problem Using Steiner Trees.
ACM Trans. Database Syst. 9(3): 348-368(1984)
- David Maier, Jeffrey D. Ullman, Moshe Y. Vardi:
On the Foundations of the Universal Relation Model.
ACM Trans. Database Syst. 9(2): 283-308(1984)
- Henry F. Korth, Gabriel M. Kuper, Joan Feigenbaum, Allen Van Gelder, Jeffrey D. Ullman:
System/U: A Database System Based on the Universal Relation Assumption.
ACM Trans. Database Syst. 9(3): 331-347(1984)
- Oded Shmueli, Alon Itai:
Maintenance of Views.
SIGMOD Conference 1984: 240-255
- Edward P. F. Chan:
Optimal Computation of Total Projections with Unions of Simple Chase Join Expressions.
SIGMOD Conference 1984: 149-163
- Jeffrey D. Ullman:
On Kent's "Consequences of Assuming a Universal Relation".
ACM Trans. Database Syst. 8(4): 637-643(1983)
- Yehoshua Sagiv:
A Characterization of Globally Consistent Databases and Their Correct Access Paths.
ACM Trans. Database Syst. 8(2): 266-286(1983)
- William Kent:
The Universal Relation Revisited.
ACM Trans. Database Syst. 8(4): 644-648(1983)
- Joachim Biskup, Hans Hermann Brüggemann:
Universal Relation Views: A Pragmatic Approach.
VLDB 1983: 172-185
- David Maier, David Rozenshtein, David Scott Warren:
Windows on the World.
SIGMOD Conference 1983: 68-78
- Alessandro D'Atri, Marina Moscarini, Nicolas Spyratos:
Answering Queries in Relational Databases.
SIGMOD Conference 1983: 173-177
- David Maier, Jeffrey D. Ullman, Moshe Y. Vardi:
The Revenge of the JD.
PODS 1983: 279-287
- Zhi-Qian Zhang, Alberto O. Mendelzon:
A Graphical Query Language for Entity-Relationship Databases.
ER 1983: 441-448
- William Kent:
Fact-Based Data Analysis and Design.
ER 1983: 3-53
- David Maier:
The Theory of Relational Databases.
Computer Science Press 1983, ISBN 0-914894-42-0
Contents - Nathan Goodman, Oded Shmueli:
Tree Queries: A Simple Class of Relational Queries.
ACM Trans. Database Syst. 7(4): 653-677(1982)
- David Maier, David Scott Warren:
Specifying Connections for a Universal Relation Scheme Database.
SIGMOD Conference 1982: 1-7
- David Maier, David Rozenshtein, Sharon C. Salveter, Jacob Stein, David Scott Warren:
Toward Logical Data Independence: A Relational Query Language Without Relations.
SIGMOD Conference 1982: 51-60
- Jeffrey D. Ullman:
The U. R. Strikes Back.
PODS 1982: 10-22
- David Maier, Jeffrey D. Ullman:
Connections in Acyclic Hypergraphs.
PODS 1982: 34-39
- Nathan Goodman, Oded Shmueli:
Transforming Cyclic Schemas into Trees.
PODS 1982: 49-54
- Catriel Beeri, Henry F. Korth:
Compatible Attributes in a Universal Relation.
PODS 1982: 55-62
- Paolo Atzeni, Douglas Stott Parker Jr.:
Assumptions in Relational Database Theory.
PODS 1982: 1-9
- Karen Chase:
Join Graphs and Acyclic Database Schemes.
VLDB 1981: 95-100
BibTeX
ACM SIGMOD Anthology - DBLP:
[Home | Search: Author, Title | Conferences | Journals]
TODS, ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Tue Jun 24 18:38:51 2008