Software:Voldemort (distributed data store)

From HandWiki
Revision as of 08:57, 9 February 2024 by MainAI5 (talk | contribs) (add)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Short description: Distributed database used by LinkedIn
Project Voldemort
Original author(s)LinkedIn / Microsoft
Initial release2009; 15 years ago (2009)
Stable release
1.10.25 / July 25, 2017; 7 years ago (2017-07-25)
Written inJava
Available inEnglish
TypeDistributed data store
LicenseApache License 2.0
Websitewww.project-voldemort.com

Voldemort is a distributed data store that was designed as a key-value store used by LinkedIn for highly-scalable storage.[1] It is named after the fictional Harry Potter villain Lord Voldemort.

Overview

Voldemort does not try to satisfy arbitrary relations and the ACID properties, but rather is a big, distributed, persistent hash table.[2] A 2012 study comparing systems for storing application performance management data reported that Voldemort, Apache Cassandra, and HBase all offered linear scalability in most cases, with Voldemort having the lowest latency and Cassandra having the highest throughput.[3]

In the parlance of Eric Brewer's CAP theorem, Voldemort is an AP type system.

Voldemort's creator and primary corporate contributor, LinkedIn, has migrated all of their systems off of Voldemort as of approximately August 2018, with no replacement sponsor (As of October 2018).[4] In 2022, LinkedIn announced Project Venice as an open source replacement[5]

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.[2][6]

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.[1]

See also

References

  1. ↑ 1.0 1.1 "Voldemort is a distributed key-value storage system". Project Voldemort - A distributed database. http://www.project-voldemort.com/voldemort/. 
  2. ↑ 2.0 2.1 "Comparison to relational databases". Project Voldemort - A distributed database. http://project-voldemort.com/. 
  3. ↑ Rabl, Tilmann; Sadoghi, Mohammad; Jacobsen, Hans-Arno; Gómez-Villamor, Sergio; Muntés-Mulero, Victor; Mankovskii, Serge (August 2012). "Solving Big Data Challenges for Enterprise Application Performance Management". Proceedings of the VLDB Endowment 5 (12): 1724–1735. doi:10.14778/2367502.2367512. http://vldb.org/pvldb/vol5/p1724_tilmannrabl_vldb2012.pdf. 
  4. ↑ project-voldemort mailing list post. 2018-08-16. Retrieved 2018-10-06.
  5. ↑ linkedin post. 2022-09-26. Retrieved 2023-11-29.
  6. ↑ Serving Large-scale Batch Computed Data with Project Voldemort

External links



Retrieved from "https://handwiki.org/wiki/index.php?title=Software:Voldemort_(distributed_data_store)&oldid=3452322"