Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article
Free access

Testing satisfaction of functional dependencies

Published: 01 July 1982 Publication History
First page of PDF

References

[1]
AHO, A. V., BERRI, C. AND ULLLIAN, J. D. The theory of joins in relational database Trans Database Syst, 4.3 (sept 11979), 297-314
[2]
BEERI, C., AND HONEYMAN, P Preserving functional dependencies SIAM J Comput. 10 (Aug. 1981), 647-656
[3]
CODD, E.F. A relational model of data for large shared data banks Commun. ACM 13, 6 (June 1968), 377-387
[4]
CODD, E.F. Further normalization of the data base relational model In Data Base Systems, R Rusttn, Ed., PrenUce Hall, Englewood Cliffs, N.J, 1972, pp 33-64
[5]
DOWNEY, P.J., SETHI, R, AND TARJAN, R E Variations on the common subexpression problem J ACM 27, 4 (Oct. 1980), 758-771
[6]
FAGIN, R. Multwalued dependencies and a new normal form for relational databases. Trans. Database Syst 2, 3 (Sept 1977), 262-278.
[7]
HONEYMAN, P., LADNER, R E, AND YANNAKAKIS, M Testing the universal instance assumption Inf. Proc. Lett 20, 1 (1980), 14-19
[8]
MAIER, D., MENDELZON, A O., AND SAGIV, Y Testing implications of data dependencies Trans. Database Syst. 4, 4 (Dec 1979), 455-469
[9]
RISSANEN, J Theory of relations for databases-A tutorial survey Proc 7th Syrup. on Mathematical Foundatzons of Computer Science, Lecture Notes in Computer Science 64, G GoDs and J Hartmanis, Eds., Springer-Verlag, Berlin, 1978, pp 536-551
[10]
SAGIV, Y Can we use the universal instance assumption without null values9 Proc. ACM-SIGMOD Int. Conf on Management of Data, Ann Arbor, Mlch, 1981, pp 108-120
[11]
ZANIOLO, C Analysis and design of relational schemata for database systems Tech. Pep UCLA- ENG-7669, Dep. of Computer Science, Univ. of Cahfornla, Los Angeles, Calif., 1976.

Cited By

View all
  • (2015)The Quest for Data Independence, Minimal Plausibility, and Formalization: The Relational Data Model (RDM)Conceptual Data Modeling and Database Design: A Fully Algorithmic Approach, Volume 110.1201/b19279-4(115-340)Online publication date: 29-Sep-2015
  • (2010)Querying Weak Instances Under Extension Chase Semantics: A Complete SolutionInternational Journal of Computer Mathematics10.1080/002071603100007950980:5(591-613)Online publication date: 15-Sep-2010
  • (2008)Two approaches to the integration of heterogeneous data warehousesDistributed and Parallel Databases10.1007/s10619-007-7022-z23:1(69-97)Online publication date: 1-Feb-2008
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Journal of the ACM
Journal of the ACM  Volume 29, Issue 3
July 1982
302 pages
ISSN:0004-5411
EISSN:1557-735X
DOI:10.1145/322326
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1982
Published in JACM Volume 29, Issue 3

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)110
  • Downloads (Last 6 weeks)19
Reflects downloads up to 15 Oct 2024

Other Metrics

Citations

Cited By

View all
  • (2015)The Quest for Data Independence, Minimal Plausibility, and Formalization: The Relational Data Model (RDM)Conceptual Data Modeling and Database Design: A Fully Algorithmic Approach, Volume 110.1201/b19279-4(115-340)Online publication date: 29-Sep-2015
  • (2010)Querying Weak Instances Under Extension Chase Semantics: A Complete SolutionInternational Journal of Computer Mathematics10.1080/002071603100007950980:5(591-613)Online publication date: 15-Sep-2010
  • (2008)Two approaches to the integration of heterogeneous data warehousesDistributed and Parallel Databases10.1007/s10619-007-7022-z23:1(69-97)Online publication date: 1-Feb-2008
  • (2007)A method to detect distinctive features from boundary dataSystems and Computers in Japan10.1002/scj.469022030422:3(31-42)Online publication date: 21-Mar-2007
  • (2007)Optimizing universal queries in relational databasesSystems and Computers in Japan10.1002/scj.469022030322:3(19-30)Online publication date: 21-Mar-2007
  • (2005)The additivity problem for data dependencies in incomplete relational databasesSemantics in Databases10.1007/BFb0035008(136-169)Online publication date: 23-Jun-2005
  • (2005)Achievements of relational database schema design theory revisitedSemantics in Databases10.1007/BFb0035004(29-54)Online publication date: 23-Jun-2005
  • (2005)Database schema design theory: Achievements and challengesInformation Systems and Data Management10.1007/3-540-60584-3_22(14-44)Online publication date: 2-Jun-2005
  • (2005)On PAC learnability of functional dependenciesAlgorithmic Learning Theory10.1007/3-540-57369-0_42(229-239)Online publication date: 31-May-2005
  • (2005)Concluding remarks and ongoing researchThe Nested Universal Relation Database Model10.1007/3-540-55493-9_7(159-161)Online publication date: 30-May-2005
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Full Access

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media