Skip to main content

Computer Science · Big Data · Topic 4 of 5

No single computer holds the data behind your "For You" feed.

The specification explicitly asks for "tools and technologies used in big data," and flags that you should be ready to explain overlap with other computer science areas — especially AI. This topic covers how systems actually store and process datasets too large for one machine, and how machine learning turns processed data into patterns and predictions.

A server rack with bundles of fiber optic cables plugged into networking equipment.
Photo: Taylor Vick / Unsplash

Executive summary

Goal: explain how distributed storage and processing work at a conceptual level, and describe how AI/ML turns big data into predictions — including the specific challenges of applying it at this scale.

SectionWhat it covers
StorageMatching the storage type to the data's shape
Distributed processingSplitting work across many machines, and batch vs stream
AI and machine learning on big dataThe mechanism behind recommendations and predictions
Worked exampleApplying AI/ML to a named platform, straight from a past paper

Storage: matching the tool to the data shape​

From Topic 2, structured and unstructured data need different homes.

Data shapeTypical storageWhy
StructuredRelational (SQL) databaseFixed schema means rows/columns can be indexed and queried precisely
Unstructured / semi-structuredNoSQL database, distributed file system, object storageNo fixed schema — needs flexible storage that doesn't force data into rows and columns
Very large volumes of eitherDistributed storage across many machinesNo single machine has enough capacity or I/O speed to hold or serve it alone

Distributed processing: splitting the work​

When a dataset is too large for one computer to process in reasonable time, the standard approach is to split the work across many machines and combine the results. This is the core idea behind distributed processing frameworks (e.g. Hadoop, Spark) — you don't need to know a specific product's internals for 91908, but you should be able to explain the underlying mechanism:

  • Partitioning — the dataset is divided into chunks
  • Parallel processing — many machines work on their chunk simultaneously, rather than one machine working through the whole dataset sequentially
  • Aggregation — the partial results are combined into a single final answer

This is why big data processing can scale: doubling the number of machines roughly halves the processing time for a task that splits cleanly, which is not possible on a single computer no matter how powerful.

Batch vs stream processing is a related distinction worth knowing:

Batch processingStream processing
When it runsOn a schedule, over data already collectedContinuously, as data arrives
Good forLarge historical analysis where some delay is acceptableTime-sensitive tasks (trending topics, fraud alerts)
Trade-offHigher latency, but can do more thorough analysisLower latency, but each item is usually processed with less context

Artificial intelligence and machine learning on big data​

This is where big data most directly overlaps with another computer science area. AI/ML techniques are what actually turn a large processed dataset into a pattern, prediction, or recommendation — this is the mechanism behind "For You" feeds, fraud detection, and predictive maintenance alike.

At a conceptual level:

  1. A model is given a large volume of historical, labelled or structured data (e.g. which past posts a user engaged with)
  2. It identifies patterns/correlations in that data
  3. It uses those patterns to make a prediction about new, unseen data (e.g. which new post this user is likely to engage with)

Exit question​

Explain, in your own words, why doubling the number of machines in a distributed system can roughly halve processing time for some tasks but not others.

Key terms

  • distributed processing
  • partitioning
  • batch processing
  • stream processing
  • machine learning (ML)
  • bias amplification
  • explainability
  1. 1
  2. 2
  3. 3
  4. 4
  5. 5