aimnova.
DashboardMy LearningPaper MasteryStudy Plan

Aimnova site navigation

Stay in the loop

Get the latest study resources and updates

New features, study tips and exam insights — straight to your inbox.

IB Diploma

  • IB Past Papers
  • IB Study Notes
  • IB Question Bank
  • IB Mock Exams
  • IB Revision

IB Subjects

  • IB Math AA
  • IB Math AI
  • IB Economics
  • IB Business Management
  • IB Physics
  • IB Biology
  • View all IB subjects→

IB Past Papers

  • IB Math AA HL Past Papers
  • IB Math AA SL Past Papers
  • IB Math AI HL Past Papers
  • IB Math AI SL Past Papers
  • IB Economics HL Past Papers
  • IB Economics SL Past Papers
  • IB ESS Past Papers
  • View all past papers→

Study Resources

  • Study Notes
  • Question Bank
  • Mock Exams
  • Flashcards
  • Revision Guide
  • Exam Skills
  • Command Terms
  • Grade Calculator
  • Exam Timetable 2026

Aimnova

  • Features
  • Pricing
  • For Schools
  • For Parents
  • About Us
  • Blog
  • Contact
aimnova.

AI-powered study platform for smarter revision, past-paper analysis and examiner-style feedback.

TermsPrivacyCookies·© 2026 Aimnova. All rights reserved.8afc4e3

Aimnova is not affiliated with or endorsed by the International Baccalaureate Organization (IB).

NotesComputer Science HLTopic 3.4
Unit 3 · Databases · Topic 3.4

IB Computer Science HL — Alternative databases

Alternative databases and data warehouses

Higher Level students should use this topic hub as a map: start with the shared sub-topics, then follow the HL-only extensions and exam-skill links where this topic asks for deeper analysis.

Exam technique guidePractice questions

Key concepts in Alternative databases

Key Idea: Relational databases are the default because they enforce structure and transactions. Everything in this topic is a deliberate trade away from those guarantees, in exchange for a shape of data or a scale that tables cannot serve.

Paper 1

  • Short definitions and one comparison.
  • State, outline, describe.

Paper 2

  • Justify a choice for a described system.
  • Evaluate, suggest, explain.

Both

  • Name what the choice gives up, not only what it gains.

🗄️ Beyond tables

TypeStores asSuitsGives up
DocumentSelf-contained recordsFields that vary per rowJoins; duplication returns
Key-valueOne key, one opaque valueCaches, sessionsQuerying the value
GraphNodes and edgesRelationships as the questionTransactional strength
Column-familyColumns groupedHuge tables, few columns readAd-hoc flexibility
Important: These are trades, not upgrades. An answer choosing a non-relational store must say what about this data does not fit tables — and for money, the answer is usually still relational.

🏭 Data warehouses

Recording against analysing

  • Operational databases take many small writes; warehouses take few enormous reads
  • A warehouse keeps history; operational systems overwrite it
  • ETL — extract from each source, transform to one consistent shape, load
  • Denormalised on purpose, and safe because it is rebuilt in bulk rather than edited
  • Current only to the last load — usually nightly, so never today's figures
Duplication is dangerous because of the update anomaly. A warehouse has no user updates — it is rebuilt wholesale — so the anomaly cannot arise. The rule is not wrong; the condition that makes it matter is absent.

🔍 OLAP and mining

OLAPData mining
You bringA questionNo question
It returnsThe answerPatterns you did not ask for
OperationsDrill down, roll up, slice, dice, pivotAssociation, clustering, anomalies
Result isA factA candidate, needing validation
Important: Test thousands of combinations and some look significant by accident. A mined pattern must be checked on data that was not used to find it — and it reports co-occurrence, never cause.

🌍 Distributed databases

The two mechanisms and the one trade-off

  • Replication keeps copies — availability and read speed
  • Fragmentation splits the data — capacity and write throughput
  • Real systems do both: shard to fit, replicate so no shard is a single failure
  • During a network partition you must choose consistency or availability
  • A bank chooses consistency; a social feed chooses availability. It is a business decision

📝 Exam-style questions

IB-style questionSuggest[6 marks]

A retailer wants to keep a live shopping basket, analyse five years of sales, and answer "customers who bought this also bought…". Suggest a storage approach for each and justify your choices.

🔒 Model answer plan

See the mark-by-mark plan — for / against / judgement, with marking guidance — in study mode.

Claim your free topic →
IB-style questionExplain[4 marks]

Explain the consistency–availability trade-off, and why a bank and a social network resolve it in opposite directions.

🔒 Model answer plan

See the mark-by-mark plan — for / against / judgement, with marking guidance — in study mode.

Claim your free topic →

✅ Quick check

Cover the answers.

When does a graph database beat relational? When the relationships are the question — a traversal against a self-join per level.

Why is a warehouse denormalised? To avoid joins on huge analytical queries. Safe because it is rebuilt in bulk, never edited, so update anomalies cannot arise.

OLAP or mining — which brings its own question? OLAP answers a question you already have. Mining produces ones you did not ask.

Replication or fragmentation for capacity? Fragmentation — splitting the data. Replication gives availability, not capacity.

Which would a bank choose in a partition? Consistency — refusing is recoverable, allowing the same money to be taken twice is not.


Exam tips

  • Say what about THIS data does not fit tables — that is the justification.
  • Money still means relational. Knowing when NOT to move shows judgement.
  • Denormalisation is safe in a warehouse because there are no user updates.
  • Check lift, not just confidence — and a mined pattern is a candidate.
  • Name the partition before naming the trade-off, then choose from the domain.

What you'll learn in Topic 3.4

  • 3.4.1 Types of database
  • 3.4.2 Data warehouses
  • 3.4.3 OLAP and data mining
  • 3.4.4 Distributed databases
Suggested study order: Read the notes for each sub-topic below → test yourself with flashcards → attempt practice questions → review exam technique.

Study resources — 3.4 Alternative databases

3.4.1

Types of database

Notes
3.4.2

Data warehouses

Notes
3.4.3

OLAP and data mining

Notes
3.4.4

Distributed databases

Notes

Ready to study Alternative databases?

Get expert practice questions with instant AI feedback, and a study planner tailored to your IB Computer Science HL exam date.

Start studying free

Topic 3.4 Alternative databases forms a core part of Unit 3: Databases in IB Computer Science HL. Mastering these concepts will strengthen your understanding of connected topics across the syllabus and prepare you for exam questions that require analysis, evaluation, and real-world application.

Previous topic
3.3 Database programming
Next topic
4.1 Machine learning fundamentals
All Computer Science HL topics
Exam technique

Ready to practice?

Get AI-graded practice questions, mock exams, flashcards, and a personalised study plan — all aligned to your IB syllabus.

Start Studying Free

No credit card required · No time limit