RSS 1 project tagged "B-Tree"

Download No website Updated 19 Jan 2013 cola

Screenshot
Pop 20.20
Vit 21.49

cola is a C implementation of the COLA structure described in the paper "Cache Oblivious Streaming B-Trees" by Bender, Farach-Colton, et al. This algorithm is a drop-in replacement for B-Tree databases/indexes which performs faster on spinning disks than B-Trees do on SSD. It's asymptotically optimal in terms of data transfers to and from disk. For example, random key inserts are turned into linear sequential writes while maintaining the property which queries always require, at most, precisely log N blocks read sequentially (but not contiguously) from disk (or half that, on average).

Screenshot

Project Spotlight

filterunit

A unit test facility for command line programs with file input and output.

Screenshot

Project Spotlight

FastFlow

A multi-core programming framework.