technologybriefs
9:44in productionCh. 1 · Origin/ 9:44 · ceiling 15 min
Software · Systems

Apache Cassandra

Cassandra trades consistency for uptime—and forces you to design your queries before you write your code.

Cassandra is a distributed, wide-column database built for write-heavy, multi-datacentre workloads. It prioritises availability and scalability over consistency. It requires upfront schema design aligned to access patterns. It was developed at Facebook for inbox search and released open-source in July 2008.

Chapters & takeaways4
  1. 1:02
    Origin

    Built at Facebook for inbox search, released open-source in July 2008.

  2. 2:28
    What it is

    A wide-column, masterless database optimised for writes, not reads.

  3. 4:21
    How it works

    Schema design must encode access patterns—no runtime flexibility.

  4. 5:55
    Where it scales

    Multi-datacentre replication is asynchronous and masterless by default.

Worth your time?

Yes. Study the whole thing.

4/ 5
What works
  • masterless replication across data centres
  • high write throughput via LSM tree
  • efficient handling of sparse-column models
  • flexible schema within column-family constraints
What does not
  • guarantee strong consistency
  • support arbitrary joins
  • enable ad-hoc querying
  • reduce operational overhead
Study it if
  • teams managing high-write, globally distributed event streams
  • engineers who can commit to query-first schema design
Skip it if
  • teams requiring ACID transactions
  • developers expecting relational abstraction
The written brief1 min read

What it is and the problem it solves

Cassandra is a free and open-source wide-column database built for high write throughput, multi-datacentre availability, and horizontal scalability. It solves the problem of storing and serving inbox-scale event data where writes vastly outnumber reads and failure domains must be isolated.

How it works

Cassandra uses an LSM tree storage layer to enable high write throughput. It combines Dynamo’s masterless, asynchronous replication with Bigtable’s column-family data model. Data is distributed across commodity servers in clusters that span multiple data centres.

What works

Its masterless replication works across data centres. Its LSM tree delivers sustained high write throughput. Its flexible schema handles sparse columns efficiently. Its eventual consistency model enables availability during network partitions.

What does not

Cassandra does not guarantee strong consistency. It does not support arbitrary joins or complex transactions. It does not simplify schema evolution when access patterns change. It does not reduce operational overhead—it shifts complexity into query design and cluster tuning.

What it changes

It changes how teams architect for write-heavy, globally distributed workloads. It replaces centralised consistency trade-offs with explicit, tunable consistency levels per operation. It forces schema design to anticipate access patterns—not just data structure.

Is it worth your time

Yes—if your workload demands high write availability, multi-datacentre resilience, and schema flexibility for sparse-column models. No—if you require strong consistency, ad-hoc querying, or low-effort operational simplicity.

Same field · Software4 of 102
10:03
Go (programming language)Robert Griesemer, Rob Pike, Ken Thompson · 2009Go is a statically typed, compiled programming language designed in 2007 by Robert Griesemer, Rob Pike, and Ken Thompson at Google to improve programming productivity for multicore, networked machines and large codebases. It combines static typing and runtime efficiency like C, readability and usability like Python, and high-performance networking and multiprocessing. Publicly announced in November 2009 and released as version 1.0 in March 2012, Go emphasizes simplicity, safety, and developer tooling — especially around concurrency via goroutines and channels, packaging, testing, and deployment — while deliberately omitting features like inheritance, assertions, pointer arithmetic, and implicit type conversions. Its design reflects a focus on the software development process itself rather than just language syntax or semantics.
10:00
Apache HadoopYahoo · 2006Hadoop is not a database or a query engine. It is a fault-tolerant batch-processing substrate built for scale, not speed or simplicity.
10:34
Amiga 10001985The Amiga 1000 is not defined by what it promised, but by what it delivered on day one: a working, shipped, ROM-locked implementation of preemptive multitasking — alongside deliberate physical design choices that treated the case as functional infrastructure. Its limitations are architectural, not aspirational.
9:14
Apache HBase2006HBase is a wide-column, non-relational, distributed database modelled after Google's Bigtable. It runs on HDFS or Alluxio. It provides fault-tolerant storage for large sparse datasets with fast read/write operations, high throughput, low I/O latency, and CP consistency per the CAP Theorem. It features compression, in-memory operation, and Bloom filters on a per-column basis. Tables can serve as input and output for MapReduce jobs and are accessible via Java API, REST, Avro, or Thrift.
Up next in Technology

Apache Hadoop

Yahoo · 2006 · 10:00

Hadoop doesn’t make big data easy—it makes it possible on broken hardware.

10:00