ACM SIGMOD Anthology ACM SIGMOD dblp.uni-trier.de

One Flavor Assumption and Gamma-Acyclicity for Universal Relation Views.

Joachim Biskup, Hans Hermann Brüggemann, L. Schnetgöke, M. Kramer: One Flavor Assumption and Gamma-Acyclicity for Universal Relation Views. PODS 1986: 148-159
@inproceedings{DBLP:conf/pods/BiskupBSK86,
  author    = {Joachim Biskup and
               Hans Hermann Br{\"u}ggemann and
               L. Schnetg{\"o}ke and
               M. Kramer},
  title     = {One Flavor Assumption and Gamma-Acyclicity for Universal Relation
               Views},
  booktitle = {Proceedings of the Fifth ACM SIGACT-SIGMOD Symposium on Principles
               of Database Systems, March 24-26, 1986, Cambridge, Massachusetts},
  publisher = {ACM},
  year      = {1986},
  isbn      = {0-89791-179-2},
  pages     = {148-159},
  ee        = {http://doi.acm.org/10.1145/6012.15412, db/conf/pods/BiskupBSK86.html},
  crossref  = {DBLP:conf/pods/86},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX

Abstract

In a universal relation view queries are expressed without mentioning relation names and they are evaluated by using socalled window functions. We discuss several design rules for database schemes suited for universal relation views and formalize one of them, the One Flavor Assumption. Intuitively the One Flavor Assumption says that the real world significance of any tuple of a window does not depend on the details of its construction. For its formalization we define the essence of join paths which are used in the universal relation system DURST. We prove a deep connection between database schemes satisfying the One Flavor Assumption and y-acyclic schemes. For such database schemes we carefully compare the essence of join paths with the unique minimal Dcap-connection, and the result of the modified GYO-reduction. For universal relation views based on such schemes the DURST window functions are essentially optimized.

Copyright © 1986 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.

Load The ACM SIGMOD Anthology, CDROM Edition, Volume 1-3, PODS '82-'98. and ... Load The ACM SIGMOD Anthology, Silver Edition, DVD 1, Proceedings. and ... BibTeX

Printed Edition

Proceedings of the Fifth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, March 24-26, 1986, Cambridge, Massachusetts. ACM 1986, ISBN 0-89791-179-2
Contents BibTeX

Online Edition: ACM Digital Library

References

[AP]
Paolo Atzeni, Douglas Stott Parker Jr.: Assumptions in Relational Database Theory. PODS 1982: 1-9 BibTeX
[ASU]
...
[BB]
Joachim Biskup, Hans Hermann Brüggemann: Universal Relation Views: A Pragmatic Approach. VLDB 1983: 172-185 BibTeX
[Be]
Philip A. Bernstein: Synthesizing Third Normal Form Relations from Functional Dependencies. ACM Trans. Database Syst. 1(4): 277-298(1976) BibTeX
[Br]
...
[F]
Ronald Fagin: Degrees of Acyclicity for Hypergraphs and Relational Database Schemes. J. ACM 30(3): 514-550(1983) BibTeX
[FMU]
...
[G]
...
[H]
Richard Hull: Acyclic Join Dependency and Data Base Projections. J. Comput. Syst. Sci. 27(3): 331-349(1983) BibTeX
[K]
...
[M]
David Maier: The Theory of Relational Databases. Computer Science Press 1983, ISBN 0-914894-42-0
Contents BibTeX
[MU]
David Maier, Jeffrey D. Ullman: Connections in Acyclic Hypergraphs. Theor. Comput. Sci. 32: 185-199(1984) BibTeX
[MUV]
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) BibTeX
[S]
...
[TY]
Robert Endre Tarjan, Mihalis Yannakakis: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs. SIAM J. Comput. 13(3): 566-579(1984) BibTeX
[U]
...
[U1]
Jeffrey D. Ullman: Principles of Database Systems, 2nd Edition. Computer Science Press 1982, ISBN 0-914894-36-6
BibTeX
[Y]
Mihalis Yannakakis: Algorithms for Acyclic Database Schemes. VLDB 1981: 82-94 BibTeX
[YO]
...

Referenced by

  1. Lev A. Tenenbaum: Blocks and Projections' Synthesis in relational Databases. MFDBS 1989: 367-381
  2. Jeffrey D. Ullman: Principles of Database and Knowledge-Base Systems, Volume II. Computer Science Press 1989, ISBN 0-7167-8162-X
    Contents
  3. Mark Levene, George Loizou: A Universal Relation Model for Nested Relations. EDBT 1988: 294-308
  4. Joachim Biskup, Hans Hermann Brüggemann: Data Manipulation Languages for the Universal Relation View DURST. MFDBS 1987: 20-41
  5. Edward P. F. Chan, Paolo Atzeni: On the Properties and Characterization of Connection-tap-free Schemes. PODS 1986: 140-147
BibTeX
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:33:49 2009