Algorithms for Acyclic Database Schemes.
Mihalis Yannakakis:
Algorithms for Acyclic Database Schemes.
VLDB 1981: 82-94@inproceedings{DBLP:conf/vldb/Yannakakis81,
author = {Mihalis Yannakakis},
title = {Algorithms for 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 = {82-94},
ee = {db/conf/vldb/Yannakakis81.html},
crossref = {DBLP:conf/vldb/81},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX
Abstract
Many real-world situations can be captured by a set of
functional dependencies and a single join dependency of a particular
form called acyclic [B..]. The join dependency corresponds to a
natural decomposition into meaningfull objects (an acyclic database
scheme). 0ur purpose in this paper is to describe efficient algorithms
in this setting for various problems, such as computing projections,
minimizing joins, inferring dependencies, and testing for
dependency satisfaction.
Copyright © 1981 by The Institute of
Electrical and Electronic Engineers, Inc. (IEEE).
Abstract used with permission.
CDROM Version: Load the CDROM "Volume 1 Issue 4, VLDB '75-'88" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...
BibTeX
Printed Edition
Very Large Data Bases, 7th International Conference, September 9-11, 1981, Cannes, France, Proceedings.
IEEE Computer Society 1981
Contents BibTeX
References
- [ABU]
- 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
- [ASU1]
- Alfred V. Aho, Yehoshua Sagiv, Jeffrey D. Ullman:
Equivalences Among Relational Expressions.
SIAM J. Comput. 8(2): 218-246(1979) BibTeX
- [ASU2]
- 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
- [Ba]
- ...
- [Be]
- Catriel Beeri:
On the Membership Problem for Functional and Multivalued Dependencies in Relational Databases.
ACM Trans. Database Syst. 5(3): 241-259(1980) BibTeX
- [BB]
- Catriel Beeri, Philip A. Bernstein:
Computational Problems Related to the Design of Normal Form Relational Schemas.
ACM Trans. Database Syst. 4(1): 30-59(1979) BibTeX
- [B..]
- Catriel Beeri, Ronald Fagin, David Maier, Alberto O. Mendelzon, Jeffrey D. Ullman, Mihalis Yannakakis:
Properties of Acyclic Database Schemes.
STOC 1981: 355-362 BibTeX
- [BV]
- Catriel Beeri, Moshe Y. Vardi:
On the Properties of Join Dependencies.
Advances in Data Base Theory 1979: 25-71 BibTeX
- [Ber]
- Philip A. Bernstein:
Synthesizing Third Normal Form Relations from Functional Dependencies.
ACM Trans. Database Syst. 1(4): 277-298(1976) BibTeX
- [BG]
- ...
- [Bg]
- ...
- [C]
- E. F. Codd:
A Relational Model of Data for Large Shared Data Banks.
Commun. ACM 13(6): 377-387(1970) BibTeX
- [F]
- Ronald Fagin:
Multivalued Dependencies and a New Normal Form for Relational Databases.
ACM Trans. Database Syst. 2(3): 262-278(1977) BibTeX
- [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) BibTeX
- [H]
- Peter Honeyman:
Testing satisfaction of functional dependencies.
J. ACM 29(3): 668-677(1982) BibTeX
- [HLY]
- Peter Honeyman, Richard E. Ladner, Mihalis Yannakakis:
Testing the Universal Instance Assumption.
Inf. Process. Lett. 10(1): 14-19(1980) BibTeX
- [L]
- Y. Edmund Lien:
On the Equivalence of Database Models.
J. ACM 29(2): 333-362(1982) BibTeX
- [M]
- ...
- [MMS]
- David Maier, Alberto O. Mendelzon, Yehoshua Sagiv:
Testing Implications of Data Dependencies.
ACM Trans. Database Syst. 4(4): 455-469(1979) BibTeX
- [MSY]
- 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
- [R]
- Jorma Rissanen:
Theory of Relations for Databases - A Tutorial Survey.
MFCS 1978: 536-551 BibTeX
- [SU]
- Fereidoon Sadri, Jeffrey D. Ullman:
A Complete Axiomatization for a Large Class of Dependencies in Relational Databases.
STOC 1980: 117-122 BibTeX
- [Sa]
- Yehoshua Sagiv:
Can We Use the Universal Instance Assumption Without Using Nulls?
SIGMOD Conference 1981: 108-120 BibTeX
- [SY]
- Yehoshua Sagiv, Mihalis Yannakakis:
Equivalences Among Relational Expressions with the Union and Difference Operators.
J. ACM 27(4): 633-655(1980) BibTeX
- [S]
- Edward Sciore:
Real-World MVD's.
SIGMOD Conference 1981: 121-132 BibTeX
- [U]
- Jeffrey D. Ullman:
Principles of Database Systems, 1st Edition.
Computer Science Press 1980
BibTeX
- [V]
- Moshe Y. Vardi:
Inferring Multivalued Dependencies From Functional and Join Dependencies.
Acta Inf. 19: 305-324(1983) BibTeX
- [W]
- ...
- [Z]
- ...
Referenced by
- Jörg Flum, Markus Frick, Martin Grohe:
Query Evaluation via Tree-Decompositions.
ICDT 2001: 22-38
- Georg Gottlob, Nicola Leone, Francesco Scarcello:
Hypertree Decompositions and Tractable Queries.
PODS 1999: 21-32
- Phokion G. Kolaitis, David L. Martin, Madhukar N. Thakur:
On the Complexity of the Containment Problem for Conjunctive Queries with Built-in Predicates.
PODS 1998: 197-204
- Christos H. Papadimitriou, Mihalis Yannakakis:
On the Complexity of Database Queries.
PODS 1997: 12-19
- Chandra Chekuri, Anand Rajaraman:
Conjunctive Query Containment Revisited.
ICDT 1997: 56-70
- Anand Rajaraman, Jeffrey D. Ullman:
Integrating Information by Outerjoins and Full Disjunctions.
PODS 1996: 238-248
- Moshe Y. Vardi:
On the Complexity of Bounded-Variable Queries.
PODS 1995: 266-276
- Serge Abiteboul, Richard Hull, Victor Vianu:
Foundations of Databases.
Addison-Wesley 1995, ISBN 0-201-53771-0
Contents - Yehoshua Sagiv, Oded Shmueli:
Solving Queries by Tree Projections.
ACM Trans. Database Syst. 18(3): 487-511(1993)
- Ouri Wolfson, Aya Ozeri:
Parallel and Distributed Processing of Rules by Data Reduction.
IEEE Trans. Knowl. Data Eng. 5(3): 523-530(1993)
- Alexander Brodsky, Joxan Jaffar, Michael J. Maher:
Toward Practical Constraint Databases.
VLDB 1993: 567-580
- Ke Wang, Marc H. Graham:
Constant-Time Maintainability: A Generalization of Independence.
ACM Trans. Database Syst. 17(2): 201-246(1992)
- Shinichi Morishita:
Avoiding Cartesian Products in Programs for Multiple Joins.
PODS 1992: 368-379
- Héctor J. Hernández, Edward P. F. Chan:
Constant-Time-Maintainable BCNF Database Schemes.
ACM Trans. Database Syst. 16(4): 571-599(1991)
- Ke Wang:
Polynomial Time Designs toward Both BCNF and Efficient Data Manipulation.
SIGMOD Conference 1990: 74-83
- Dan E. Willard:
Quasilinear Algorithms for Processing Relational Calculus Expressions.
PODS 1990: 243-257
- Paolo Atzeni, Edward P. F. Chan:
Efficient Optimization of Simple Chase Join Expressions.
ACM Trans. Database Syst. 14(2): 212-230(1989)
- Jeffrey D. Ullman:
Principles of Database and Knowledge-Base Systems, Volume II.
Computer Science Press 1989, ISBN 0-7167-8162-X
Contents - Héctor J. Hernández, Edward P. F. Chan:
A Characterization of Constant-time-mainteinability for BCNF Database Schemes.
SIGMOD Conference 1988: 209-217
- Edward P. F. Chan, Héctor J. Hernández:
Independence-reducible Database Schemes.
PODS 1988: 163-173
- Edward P. F. Chan, Héctor J. Hernández:
On Designing Database Schemes Bounded or Constant-time-maintainable with respect to Functional Dependencies.
PODS 1987: 48-57
- Paolo Atzeni, Maria Cristina De Bernardis:
A New Basis for the Weak Instance Model.
PODS 1987: 79-86
- Allen Van Gelder:
A Message Passing Framework for Logical Query Evaluation.
SIGMOD Conference 1986: 155-165
- Yehoshua Sagiv, Oded Shmueli:
On Finite FD-Acyclicity.
PODS 1986: 173-182
- Yehoshua Sagiv, Oded Shmueli:
The Equivalence of Solving Queries and Production Tree Projections.
PODS 1986: 160-172
- Edward P. F. Chan, Paolo Atzeni:
On the Properties and Characterization of Connection-tap-free Schemes.
PODS 1986: 140-147
- 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
- Dirk Van Gucht:
Interaction-Free Multivalued Dependency Sets.
ICDT 1986: 409-420
- Edward P. F. Chan, Héctor J. Hernández:
On the Desirability of gamma-Acyclic BCNF Database Schemes.
ICDT 1986: 105-122
- Jacob Stein, David Maier:
Relaxing the Universal Relation Scheme Assumption.
PODS 1985: 76-84
- Yehoshua Sagiv:
On Computing Restricted Projections of Representative Instances.
PODS 1985: 171-180
- 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)
- Alessandro D'Atri, Domenico Saccà:
Equivalence and Mapping of Database Schemes.
VLDB 1984: 187-195
- Dan E. Willard:
Efficient Processing of Relational Calculus Expressions Using Range Query Theory.
SIGMOD Conference 1984: 164-175
- 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
- Mihalis Yannakakis:
Querying Weak Instances.
PODS 1984: 275-280
- Domenico Saccà, F. Manfredi, A. Mecchia:
Properties of Database Schemata with Functional Dependencies.
PODS 1984: 19-28
- Marc H. Graham, Moshe Y. Vardi:
On the Complexity and Axiomatizability of Consistent Database States.
PODS 1984: 281-289
- Alessandro D'Atri, Marina Moscarini:
On the Recognition and Design of Acyclic Databases.
PODS 1984: 1-8
- Jeffrey D. Ullman:
On Kent's "Consequences of Assuming a Universal Relation".
ACM Trans. Database Syst. 8(4): 637-643(1983)
- David Maier, David Rozenshtein, David Scott Warren:
Windows on the World.
SIGMOD Conference 1983: 68-78
- Domenico Saccà:
On the Recognition of Coverings of Acyclic Database Hypergraphs.
PODS 1983: 297-304
- David Maier, Jeffrey D. Ullman, Moshe Y. Vardi:
The Revenge of the JD.
PODS 1983: 279-287
- Nathan Goodman, Oded Shmueli, Y. C. Tay:
GYO Reductions, Canonical Connections, Tree and Cyclic Schemas and Tree Projections.
PODS 1983: 267-278
- Stavros S. Cosmadakis:
The Complexity of Evaluating Relational Queries.
PODS 1983: 149-155
- Catriel Beeri, Michael Kifer:
Elimination of Intersection Anomalies from Database Schemes.
PODS 1983: 340-351
- David Maier:
The Theory of Relational Databases.
Computer Science Press 1983, ISBN 0-914894-42-0
Contents - David Maier, David Scott Warren:
Specifying Connections for a Universal Relation Scheme Database.
SIGMOD Conference 1982: 1-7
- Jeffrey D. Ullman:
The U. R. Strikes Back.
PODS 1982: 10-22
- Marc H. Graham, Mihalis Yannakakis:
Independent Database Schemas.
PODS 1982: 199-204
BibTeX
ACM SIGMOD Anthology - DBLP:
[Home | Search: Author, Title | Conferences | Journals]
VLDB Proceedings (1977-1981): Copyright © by IEEE,
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:45:11 2009