Relational databases: Explain the concept of a database.

The idea

A database is an organised store of related data that is structured so it can be searched, sorted and updated efficiently. Rather than keeping separate lists that duplicate information, a database holds data in tables of records and fields, and a relational database links tables using keys so the same fact is stored once. For example, a school database might hold a student table and a club table, linked by a student identifier, so a student's name is not repeated for every club they join. This structure supports queries, reduces duplication and helps keep data consistent. In an exam answer you would define the concept, describe the table/record/field structure and explain the benefit of organised, related data.

What earns the marks

• Defines a database as an organised collection of related data.
• Describes data held in tables made up of records and fields.
• Explains that a relational database links tables using keys such as a primary key.
• States a benefit such as reduced duplication, easier searching or consistent data.
• Gives a concrete example of related tables linked by an identifier.

Common mistakes and how to put them right

• Describing a database as just a single list or spreadsheet.

  Put it right by explaining the structured tables of records and fields and the links between them.

• Ignoring the relational aspect.

  Put it right by mentioning keys that link tables so data is stored once.

• Listing benefits without defining the concept.

  Put it right: First stating what a database is, then adding the advantages.

Exam tips

• Start with a one-sentence definition before adding structure and benefits.
• Use the terms table, record, field and key accurately to show understanding.
• Support the explanation with a short example of two related tables to make the concept concrete.