GCSE · Computer Science · AQA · Spec 8525

Data redundancy and inconsistency

One database, one customer, two different answers to "where does Sam live?" How does a database end up disagreeing with itself?

Databases · Redundancy to inconsistency

Sam moves house. Who updates what?

Step through the same change twice: first on a flat table, then on linked tables.

Before you step: Sam Patel's address is written on three orders. Sam moves. What would have to go wrong for the database to hold two different addresses for Sam?

DesignStepOrder 101Order 102Order 103Customers tableCopies agree?
Flat tableStart5 Mill Lane5 Mill Lane5 Mill Lane(none)Yes

Output

 

Step 1: Sam's address is written on every order. Same data, stored in three places: that's data redundancy. Right now it's harmless, because every copy says the same thing.

1 / 6

Use the step controls and watch the last column. Which step is the one that goes wrong?

Step 1 of 6: Sam's address is written on every order. Same data, stored in three places: that's data redundancy. Right now it's harmless, because every copy says the same thing..

Databases · Two terms, not one

Redundancy, inconsistency, or both?

Tick every set each snippet belongs to. Careful: a snippet can be in both sets, or in neither.

  • A Shows redundancy
  • B Shows inconsistency
  1. A customer's address on 3 orders, all saying 9 Park Road
  2. A customer's address on 3 orders: two say 9 Park Road, one says 5 Mill Lane
  3. A customer's address held once in a Customers table; orders only store the customer ID
  4. A product's price copied onto 4 order lines, all showing £2.50
  5. A product's price on 2 order lines: £2.50 on one, £2.75 on the other
  6. Each teacher's room number stored once; timetable rows link to the teacher

Computer Science · Structure

The redesign: two tables, one link

Tap any box to see what it does.

Customers tableOrders tablesame ID joins them

Tap any part of the diagram to see what it does.

What repetition costs

One flat table (repeated data)vsLinked tables (stored once)

Flat table with repeated data against linked tables.

Focus

Copies of each fact

One flat table (repeated data)

Many: the same fact is repeated on record after record

Linked tables (stored once)

One, apart from the key that links the tables

The insight

Every extra copy is one more thing that has to be kept in step.

Storage used

One flat table (repeated data)

More: the same data is stored again and again

Linked tables (stored once)

Less: each fact is stored a single time

Places to change

One flat table (repeated data)

Every copy has to be found and changed

Linked tables (stored once)

One place

Updating

One flat table (repeated data)

Slower and more error-prone

Linked tables (stored once)

Quicker and less error-prone

Risk of inconsistency

One flat table (repeated data)

Higher: a missed copy leaves conflicting values

Linked tables (stored once)

Lower: a single stored copy cannot disagree with itself

Your turn · Explain it in your own words

Write the whole chain

Explain how data redundancy can lead to data inconsistency, and how using linked tables reduces the risk. [4 marks]

0 words · your answer stays on this page and is not sent anywhere.

WHAT YOU'VE LEARNED

A quick recap of today's lesson.

What you need to know

  • Data redundancy means the same data is stored in more than one place in a database.
  • Data inconsistency means copies of the same data don't match.
  • Have a goYour friend says: "My phone number is on three school forms. Two say 07700 900123 and one says 07700 900321." Redundancy, inconsistency, or both?

    Both.

    The number is stored in more than one place (redundancy) and the copies don't match (inconsistency).

  • Redundancy is the repeating; inconsistency is the copies disagreeing. They are not the same thing.
  • Redundancy is what makes inconsistency possible: with only one copy, there is nothing to disagree with.
  • Have a goMaya is sure that if a database has redundancy, it must be inconsistent. What could be true of a redundant database that proves her wrong?

    All the copies match, so it is redundant but still consistent.

    Redundancy only makes inconsistency possible; it takes copies that disagree for the data to be inconsistent.

  • It goes wrong when an update changes some copies but misses others.
  • Redundancy also wastes storage space, and makes updates slower and more error-prone.
  • The fix is to split the data into linked tables, so each fact is stored once.
  • A primary key identifies each record in a table.
  • A foreign key is a field that holds another table's primary key, and that is how the tables are linked.
  • Have a goAn Orders table stores "CustomerID 7" on each order. That ID is the primary key of a record in the Customers table. In Orders, is it a primary key or a foreign key?

    A foreign key.

    It sits in Orders but holds the primary key of a record in another table, which is exactly what a foreign key is.

  • Now a change is made in one place, so the risk of inconsistency is reduced.

The big picture

Storing the same data in more than one place is called data redundancy. If an update changes some copies but misses others, the copies stop matching, which is data inconsistency. Redundancy also wastes storage space and makes updates slower and more error-prone. Splitting the data into linked tables, joined by a primary key and a foreign key, stores each fact once so a change is made in one place.

Key points

1Data redundancy is the same data stored in more than one place.
2Data inconsistency is copies of the same data that no longer match.
3Inconsistency happens when an update misses a copy, so redundancy is what makes it possible.
4Redundancy wastes storage space and makes updates slower and more error-prone.
5Linked tables store each fact once, using a primary key and a foreign key to link the records.

Worked example

Problem

A school library stores each member's form group on every one of their loan records. Mia has 4 loans and moves from form 10B to form 10C. The librarian updates 3 of her 4 loan records. (a) What is redundant? (b) Is the data now consistent? (c) How would linked tables fix this?

⚠ Watch out

Treating redundancy and inconsistency as two names for the same problem. Redundancy is the repeated data. Inconsistency is what you get when the copies stop matching. A redundant database can still be consistent, until a change misses a copy.

🧠

Memory hook

Redundancy is repeating. Inconsistency is repeating that fell out of step. The cure: say it once and link it by key.

✓

Check yourself

Cover the page and finish these in your own words: "Redundancy means ___. Inconsistency means ___. Redundancy makes inconsistency possible because ___." Then say what a foreign key stores.

Flashcards

(10)
What is data redundancy?
The same data stored in more than one place in a database.
What is data inconsistency?
Copies of the same data that don't match, so the database holds conflicting values for one item.
Which one makes the other possible: redundancy or inconsistency?
Redundancy makes inconsistency possible. Inconsistency needs copies to disagree, though redundancy alone does not guarantee it.
When does redundancy lead to inconsistency?
When an update changes some copies of the data but misses others.
Besides inconsistency, what does redundancy cost?
Wasted storage space, and updates that are slower and more error-prone.
Why does redundancy make updates error-prone?
There are more copies to change, so there are more chances to miss one.
How is redundancy reduced?
Split the data into linked tables so each fact is stored once.
What is a primary key?
A field that identifies each record in a table.
What is a foreign key?
A field that holds the primary key of a record in another table, which links the two tables.
Why do linked tables reduce the risk of inconsistency?
A change is made in one place, so no other copy is left behind to disagree.

Tap any card to flip it, or use Study as deck to go through them one at a time. In the full lesson these run as a spaced-repetition deck — you rate each card Hard, Good or Easy and the tricky ones keep coming back until they stick.

Learning with Lightbulb is opening soon

You can use this lesson now. Join the waitlist and we'll let you know when the full Lightbulb experience is ready.

Keep me posted

More AQA GCSE Computer Science topics

See the full AQA Computer Science curriculum →

How this lesson was checked. This AQA GCSE Computer Science (specification 8525)lesson was published through Lightbulb Learning's human-designed editorial process — the educational standards, accuracy rules and publication checks it must pass were authored and approved by Philip Halpin. It passed subject-specific assessment, automated educational checks and technical publication verification before going live (publication checks completed 9 October 2026). Published pages are monitored, human spot-checking is ongoing across the lesson library, and anything found wrong is corrected or withdrawn. How our lessons are made and checked. Spotted a mistake? Email hello@lightbulblearning.co and we'll review it.