A database's primary key is crucial for ensuring each record in a table is uniquely identifiable. When multiple candidate keys exist for selection, the primary key is usually chosen based on its simplicity and efficiency. A candidate key is a collection of attributes capable of uniquely identifying a row (tuple) within a table.
The appropriate selection from the given choices is: The simplest available candidate key. This principle dictates that among the candidate keys, the one with the most straightforward structure and the fewest attributes is typically favored as the primary key. This preference for simplicity enhances database performance and simplifies data management.
| RollNo | Name | Mobile | City |
| 1 | Arun | 91 | Delhi |
| 2 | Sanjay | 92 | Mumbai |
| 3 | Arun | 93 | Noida |
| 4 | Varun | 94 | Guwahati |
| 5 | Arti | 95 | Kolkata |
| List-I | List-II |
| (A) Controlled Data Sharing | (I) Same data maintained in different places does not match |
| (B) Data Isolation | (II) Limited Access given to users |
| (C) Data Dependence | (III) There is no mapping between two files |
| (D) Data Inconsistency | (IV) If the structure of a file is changed, all the existing programs accessing that file also need to be changed |