A blog post by google made the rounds lately with people saying that google was
saying that they beat the CAP Theorem, so I went to the source. The conclusion
is interesting:

Spanner reasonably claims to be an “effectively CA” system despite operating over a wide area, as it is
always consistent and achieves greater than 5 9s availability. As with Chubby, this combination is possible
in practice if you control the whole network, which is rare over the wide area. Even then, it requires
significant redundancy of network paths, architectural planning to manage correlated failures, and very
careful operations, especially for upgrades. Even then outages will occur, in which case Spanner chooses
consistency over availability.
Spanner uses two-phase commit to achieve serializability, but it uses TrueTime for external consistency,
consistent reads without locking, and consistent snapshots.

I wanted to read the LSM-tree paper and it seems I didn't look what I was clicking
so instead I ended up reading the LSM-trie paper, which is really interesting
and has an overview of the LSM-tree one, now I have to go and read that one too.

I've been thinking lately about the relation between Pivot Tables, Data Cubes and
the things mentioned in the paper A Layered Grammar of Graphics
so I started reading more about Data Cubes, I skimmed a couple papers that I
forgot to register somewhere but this one was one I actually registered.

Someone somewhere mentioned this paper so I went to look, it's a really good
one, like the Metaobject protocol paper and other's I've read, this one is like
a condensation of years of knowledge and experiences that are really
interesting to read.

Interesting book about a really interesting (and different) object oriented
programming language by the creators of Simula (aka the creators of object
orientation), it explains an abstraction called "patterns" in which all other
abstractions are expressed.