Ernestas Poškus

Technical blog

"We must view with profound respect the infinite capacity of the human mind to resist the introduction of useful knowledge." - Thomas R. Lounsbury

| github | goodreads | linkedin | twitter |

ansible 2 / elasticsearch 2 / kernel 2 / leadership 1 / linux 2 / mnemonics 1 / nginx 1 / paper 40 / personal 5 / rust 1 / tools 2 /

Spanner: Google’s Globally-Distributed Database

WC 467 / RT 3min


Spanner is a scalable, globally-distributed database designed, built, and deployed at Google.

At the highest level of abstraction, it is a database that shards data across many sets of Paxos state machines.

Replication is used for global availability and geographic locality.

Spanner is designed to scale up to millions of machines across hundreds of datacenters and trillions of database rows.

Data is stored in schematized semi-relational tables; data is versioned, and each version is automatically timestamped with its commit time; old versions of data are subject to configurable garbage-collection policies; and applications can read data at old timestamps.

Major features:


A Spanner deployment is called a universe. Given that Spanner manages data globally, there will be only a handful of running universes.

Spanner is organized as a set of zones, where each zone is the rough analog of a deployment of Bigtable.

Zones are the unit of administrative deployment.

Zones are also the unit of physical isolation: there may be one or more zones in a datacenter, for example, if different applications’ data must be partitioned across different sets of servers in the same datacenter.

Each spanserver is responsible for between 100 and 1000 instances of a data structure called a tablet. A tablet is similar to Bigtable’s tablet abstraction, in that it implements a bag of the following mappings:

(key:string, timestamp:int64) → string

Unlike Bigtable, Spanner assigns timestamps to data, which is an important way in which Spanner is more like a multi-version database than a key-value store.

Tablet state is stored in set of B-tree-like files and a write-ahead log, all on a distributed file system called Colossus.

To support replication, each spanserver implements a single Paxos state machine on top of each tablet.


TrueTime explicitly represents time as a TTinterval, which is an interval with bounded time uncertainty (unlike standard time interfaces that give clients no notion of uncertainty).

The time epoch is anal- ogous to UNIX time with leap-second smearing. De- fine the instantaneous error bound as ϵ, which is half of the interval’s width, and the average error bound as ϵ.

TrueTime is implemented by a set of time master machines per datacenter and a timeslave daemon per machine. The majority of masters have GPS receivers with dedicated antennas; these masters are separated physically to reduce the effects of antenna failures, radio interference, and spoofing.

The remaining masters (which we refer to as Armageddon masters) are equipped with atomic clocks. An atomic clock is not that expensive: the cost of an Armageddon master is of the same order as that of a GPS master.

Between synchronizations, a daemon advertises a slowly increasing time uncertainty.


Colossus - the successor of GFS

GFS - Google File System