The Log-Structured Merge-Tree (LSM Tree)

The Log-Structured Merge-Tree (LSM Tree) - O'Neil et al. '96. Log-Structured Merge is an important technique used in many modern data stores (for example, BigTable, Cassandra, HBase, Riak, ...). Suppose you have a hierarchy of storage options for data - for example, RAM, SSDs, Spinning disks, with different price/performance characteristics. Furthermore, you have a large ... Continue Reading

One VM to Rule Them All

One VM to rule them all - Wuerthinger et al. 2013 Building high-performance virtual machines is hard , and a number of widely used languages only have lower-performance implementations. Wuerthinger et al. want to make it easier for you to create high-performance VMs without needing to create highly complex implementations. According to the paper: Java ... Continue Reading

RAPPOR: Randomized Aggregatable Privacy-Preserving Ordinal Response

RAPPOR: Randomized Aggregatable Privacy-Preserving Ordinal Response - Erlingsson et al. 2014 The RAPPOR paper made a brief appearance on HN a few weeks ago, and addresses the question of privacy preservation while collecting data - for example, in order to improve a service offering. Crowdsourcing data to make better, more informed decisions is becoming increasingly ... Continue Reading