This test is run by .
Note that your final mark will not be saved in the system.
Note that your final mark will not be saved in the system.
6. Databases MatchUp
Target Level
C
Running Total
0
0%
Attempt
1 of 3
Click on a top box, then click on its match below. Or, drag a top box and drop it onto the correct match. Match all pairs before clicking ‘Check’.
Relational
Normalisation
Consistency
Record
Secondary key
Indexing
Foreign key
Durability
Third normal form
Primary key
Field
Flat file
Isolation
Composite key
A system of storing data that relies on a single, often very large, table.
Before a transaction, as well as after a transaction, a database must always be in a legal state.
Ensuring that one transaction, as applied to a database table, is not interfered with by another transaction being applied to that same database.
A field within a table used to uniquely identify each record.
An instance within a table, typically represented as a row.
A primary key comprised of more than one field, wherein the combination needs to be unique.
Describes data divided into entities, each of which comprises fields that depend on the key, the whole key and nothing but the key.
A type of database that involves multiple interconnected tables.
An attribute within a table, typically represented as a column.
In order to facilitate a one-to-many relationship, there must be one of these at the 'many' end of that relationship.
The process of minimising repeated data within a relational database.
A potential candidate for the primary key which was rejected in favour of some other candidate.
Once a database transaction has been committed, it should remain committed.
The process of assembling a data structure that speeds up searches for data, which might not necessarily be part of a key.