Ringo - Distributed key-value storage for immutable data

Wednesday, December 17, 2008 at 11:49AM
tmielika in Fault-tolerance, Python, consistent hashing, distributed storage, erlang, immutable data, key-value store

Ringo is an experimental, distributed, replicating key-value store based on consistent hashing and immutable data. Unlike many general-purpose databases, Ringo is designed for a specific use case: For archiving small (less than 4KB) or medium-size data items (<100MB) in real-time so that the data can survive K - 1 disk breaks, where K is the desired number of replicas, without any downtime, in a manner that scales to terabytes of data. In addition to storing, Ringo should be able to retrieve individual or small sets of data items with low latencies (<10ms) and provide a convenient on-disk format for bulk data access.

Ringo is compatible with the map-reduce framework Disco and it was started at Nokia Research Center Palo Alto.

Article originally appeared on (http://highscalability.com/).