---
title: "Wide-Column and Graph Stores"
description: "A wide-column store arranges data by the queries it must serve, so the design starts from the access pattern rather than the entities. A graph store makes relationships first-class, which turns a chai"
canonical: https://lightmysky.com/learn/computing/wide-column-and-graph-stores-mt_4a4yDq83fy
source: https://lightmysky.com/learn/computing/wide-column-and-graph-stores-mt_4a4yDq83fy.md
retrieved: 2026-09-12
---

> **Agent view.** This is the Markdown twin of the page, for tools and assistants.
> When to use this site, and the call that answers each job: https://lightmysky.com/agent-instructions.md
> API description (OpenAPI 3.1): https://lightmysky.com/openapi.json · Authentication: https://lightmysky.com/auth.md
> Pricing: https://lightmysky.com/pricing.md · Catalog: https://lightmysky.com/llms.txt · Full catalog: https://lightmysky.com/llms-full.txt
> Every machine-readable file on this domain: https://lightmysky.com/.well-known/ai-catalog.json
> Ask for Markdown with `Accept: text/markdown`, a `.md` address, or `?mode=agent`.

# Wide-Column and Graph Stores

A wide-column store arranges data by the queries it must serve, so the design starts from the access pattern rather than the entities. A graph store makes relationships first-class, which turns a chain of joins into a traversal.

Subject: Computing · Area: Data & Databases · Ages 20 to 22
Page: https://lightmysky.com/learn/computing/wide-column-and-graph-stores-mt_4a4yDq83fy

## Ready when they can

- Design a wide-column table starting from the query it must answer
- Express a friends-of-friends question as a traversal rather than repeated joins
- Say which questions a graph store answers cheaply and which it does not

## Lesson: Design from the question

You already know tables model entities and joins connect them. A wide-column store flips the starting point. You begin from the access pattern, the exact query the app must answer fast, and shape the table around it.

**Example.** Your app must show one user's inbox in time order. So you build a table keyed by user, with that user's messages clustered by timestamp inside the row. The query reads one row and the inbox is already sorted.

A graph store makes relationships first-class instead. People and friendships are stored as nodes and edges, so a friends-of-friends question becomes a walk along edges. In SQL the same question needs a chain of joins, one per hop.

**Tip.** Pick the store by the question shape. Hop-by-hop neighbourhood questions are cheap in a graph, while questions that scan every node cost a lot. A graph buys cheap traversals and gives up cheap whole-store scans.

**Recap.** Wide-column tables start from the query, and graph stores turn join chains into cheap walks along edges.

## Practice

8 questions on this page, each with its working shown.

## Needs first

- [Key-Value and Document Stores](https://lightmysky.com/learn/computing/key-value-and-document-stores-mt_PfBDSgfeQX)
- [Graphs and How to Store Them](https://lightmysky.com/learn/computing/graphs-and-how-to-store-them-mt_tSO-F1sTuu)

## Opens up

- [Partitioning and Replication for Scale](https://lightmysky.com/learn/computing/partitioning-and-replication-for-scale-mt_Xvzz5Hnuvu)