Voldemort (distributed data store)
 | This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages)
|
| Project Voldemort | |
|---|---|
| Developer(s) | |
| Initial release | 2009 |
| Stable release | 1.6.0
/ January 31, 2014 |
| Repository | |
| Written in | Java |
| Operating system | Cross-platform |
| Available in | English |
| Type | key-value store |
| License | Apache License 2 |
| Website | www |
I can't write on the actual Voldemort page so here is good enough.
It is Voldemort's birthday
You should all appreciate it.
Properties
Voldemort uses in-memory caching to eliminate a separate caching tier. It has a storage layer that is possible to emulate. Voldemort reads and writes scale horizontally. The API decides data replication and placement and accommodates a wide range of application-specific strategies.[1][2]
The Voldemort distributed data store supports pluggable placement strategies for distribution across data centers. Data is automatically replicated across servers. Data is partitioned meaning a single server contains only a portion of the total data. Each data node is independent to avoid central point of failure. Pluggable serialization allows rich keys and values including lists and tuples with named fields, as well as the integration with common serialisation frameworks such as Avro, Java Serialization, Protocol Buffers, and Thrift. Server failures are handled transparently. Data items are versioned, which maximizes data integrity.[3]
See also
References
External links
T-