ACM SIGMOD Anthology VLDB dblp.uni-trier.de

Join Graphs and Acyclic Database Schemes.

Karen Chase: Join Graphs and Acyclic Database Schemes. VLDB 1981: 95-100
@inproceedings{DBLP:conf/vldb/Chase81,
  author    = {Karen Chase},
  title     = {Join Graphs and Acyclic Database Schemes},
  booktitle = {Very Large Data Bases, 7th International Conference, September
               9-11, 1981, Cannes, France, Proceedings},
  publisher = {IEEE Computer Society},
  year      = {1981},
  pages     = {95-100},
  ee        = {db/conf/vldb/Chase81.html},
  crossref  = {DBLP:conf/vldb/81},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

The use of one acyclic join dependency and a set of functional dependencies appears powerful enough to represent data semantics in a relational database. There are several ways to characterize the acyclic join dependency, each providing its own desirable properties. In this paper we provide a sufficient condition for a join dependency to be acyclic and an algorithm that can aid a database designer. If the join dependency the designer wishes to use is cyclic, then, based on the results of the algorithm, we give two distinct methods that the designer can use to solve this problem. The methods can be implemented syntactically; however, the choice of a solution in a given case depends on the intended semantics. We also show how a combination of the two methods might be best in some cases.

Copyright © 1981 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.


ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 1 Issue 4, VLDB '75-'88" and ... DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...

Printed Edition

Very Large Data Bases, 7th International Conference, September 9-11, 1981, Cannes, France, Proceedings. IEEE Computer Society 1981
Contents CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML

References

[AHU]
Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman: The Design and Analysis of Computer Algorithms. Addison-Wesley 1974, ISBN 0-201-00029-6
CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[BFMaMUY]
Catriel Beeri, Ronald Fagin, David Maier, Alberto O. Mendelzon, Jeffrey D. Ullman, Mihalis Yannakakis: Properties of Acyclic Database Schemes. STOC 1981: 355-362 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[BFMY]
Catriel Beeri, Ronald Fagin, David Maier, Mihalis Yannakakis: On the Desirability of Acyclic Database Schemes. J. ACM 30(3): 479-513(1983) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[FMU]
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) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[G]
...
[MU]
David Maier, Jeffrey D. Ullman: Maximal Objects and the Semantics of Universal Relation Databases. ACM Trans. Database Syst. 8(1): 1-14(1983) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[Sc1]
...
[Sc2]
...
[U]
Jeffrey D. Ullman: Principles of Database Systems, 1st Edition. Computer Science Press 1980
CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML

Copyright © Tue Mar 16 02:21:56 2010 by Michael Ley (ley@uni-trier.de)