An efficient algorithm to compute the candidate keys of a relational database schema

Computer Journal

Volumn 39, Issue 2, 1996, Pages

  Saiedian, Hossein ^a   Spencer, Thomas ^a  

^a UNIVERSITY OF NEBRASKA AT OMAHA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 3743051487     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (9)

1. Armstrong, W. (1974) Dependency structures of database relationships. In Proc. 1974 IFIP Congress, pp. 580-583.
2. Ullman, J. (1988) Principles of Database and Knowledge-Based Systems, volume I. Computer Science Press, Rockville, MD.
3. Maier, D. (1983) The Theory of Relational Databases. Computer Science Press, Rockville, MD.
4. Lucchesi, C and Osborn, S. (1978) Candidate keys for relations. Journal of Computer and Systems Sciences, 17(2), 270-279.
5. Elmasri, R. and Navathe, S. B. (1994) Fundamentals of Database Systems. Benjamin-Cummings, Menlo Park, CA, 2nd edition.
6. Kundu, S. (1985) An improved algorithm for finding a key of a relation. In Proceedings of the ACM Symposium on Principles of Database Systems, pages 189-192. ACM.
7. Ausiello, G., D'atri, A. and Saccà, D. (1983) Graph algorithms for functional dependency manipulation. Journal of the ACM, 30(4), 752-766.
8. Biskup, J., Demetrovics, J., Libkin, L. and Muchnik, I. (1991) On relational database schemes having unique minimal key. J. Information Processing Cybernetics, 27, 217-225.
9. Maier, D. (1980) Minimum covers in the relational database model. Journal of the ACM, 27(4), 664-674.