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

On the Complexity of Testing Implications of Functional and Join Dependencies.

David Maier, Yehoshua Sagiv, Mihalis Yannakakis: On the Complexity of Testing Implications of Functional and Join Dependencies. J. ACM 28(4): 680-695(1981)
@article{DBLP:journals/jacm/MaierSY81,
  author    = {David Maier and
               Yehoshua Sagiv and
               Mihalis Yannakakis},
  title     = {On the Complexity of Testing Implications of Functional and Join
               Dependencies},
  journal   = {J. ACM},
  volume    = {28},
  number    = {4},
  year      = {1981},
  pages     = {680-695},
  ee        = {db/journals/jacm/MaierSY81.html, http://doi.acm.org/10.1145/322276.322280},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX

ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 5 Issue 2, JACM, VLDB-J, POS, ..." and ... DVD Version: Load ACM SIGMOD Anthology DVD 2" and ... BibTeX

Online Edition

Citation Page BibTeX

Referenced by

  1. Serge Abiteboul, Richard Hull, Victor Vianu: Foundations of Databases. Addison-Wesley 1995, ISBN 0-201-53771-0
    Contents
  2. Priti Mishra, Margaret H. Eich: Join Processing in Relational Databases. ACM Comput. Surv. 24(1): 63-113(1992)
  3. Margareta Dina Draghici: An Extended View on Data Base Conceptual Design. MFDBS 1989: 148-171
  4. Jeffrey D. Ullman: Principles of Database and Knowledge-Base Systems, Volume II. Computer Science Press 1989, ISBN 0-7167-8162-X
    Contents
  5. John H. Leuchner, Les Miller, Giora Slutzki: A Polynomial Time Algorithm for Testing Implications of a Join Dependency and Embodied Functional Dependencies. SIGMOD Conference 1988: 218-224
  6. Serge Abiteboul, Paris C. Kanellakis, Gösta Grahne: On the Representation and Querying of Sets of Possible Worlds. SIGMOD Conference 1987: 34-48
  7. Dan E. Willard: Efficient Processing of Relational Calculus Expressions Using Range Query Theory. SIGMOD Conference 1984: 164-175
  8. Domenico Saccà, F. Manfredi, A. Mecchia: Properties of Database Schemata with Functional Dependencies. PODS 1984: 19-28
  9. Marc H. Graham, Moshe Y. Vardi: On the Complexity and Axiomatizability of Consistent Database States. PODS 1984: 281-289
  10. David Maier, Jeffrey D. Ullman: Maximal Objects and the Semantics of Universal Relation Databases. ACM Trans. Database Syst. 8(1): 1-14(1983)
  11. Domenico Saccà: On the Recognition of Coverings of Acyclic Database Hypergraphs. PODS 1983: 297-304
  12. Stavros S. Cosmadakis, Christos H. Papadimitriou: Updates of Relational Views. PODS 1983: 317-331
  13. Stavros S. Cosmadakis: The Complexity of Evaluating Relational Queries. PODS 1983: 149-155
  14. David Maier: The Theory of Relational Databases. Computer Science Press 1983, ISBN 0-914894-42-0
    Contents
  15. 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)
  16. Mihalis Yannakakis: Algorithms for Acyclic Database Schemes. VLDB 1981: 82-94
BibTeX

Copyright © Sun May 17 00:05:33 2009 by Michael Ley (ley@uni-trier.de)