Search code examples
databaserelational-databasenormalizationdatabase-normalization

How to design a table if it has no candidate keys?


Currently in my database class we are discussing the relational model and normalization and so on. I have answered every question in my homework with ease but this one has thrown me for a loop:

  • If a table has no candidate keys, then what is the general practice to design a table?

There is no example here of a table with no candidate keys. The question above is all I have and I feel like that's too vague.

My first thought was to find any determinants (even if they were not a candidate key) and create a new table with those functional dependencies, but I don't even know that any functional dependencies exist in the table in the first place. Is there a possible answer for this?


Solution

  • You can create an additional column that is guaranteed to be unique (auto-increment integer) for example.