An Efficient Algorithm to Compute the Candidate Keys of a Relational Database Schema (Q4886686): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1093/comjnl/39.2.124 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2119631806 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 20:06, 19 March 2024
scientific article; zbMATH DE number 907011
Language | Label | Description | Also known as |
---|---|---|---|
English | An Efficient Algorithm to Compute the Candidate Keys of a Relational Database Schema |
scientific article; zbMATH DE number 907011 |
Statements
An Efficient Algorithm to Compute the Candidate Keys of a Relational Database Schema (English)
0 references
11 December 1996
0 references
functional dependencies
0 references
relational database
0 references