Key–value database

Print Print
Reading time 5:28

A tabular data card proposed for Babbage's Analytical Engine showing a key–value pair, in this instance a number and its base-ten logarithm

A key–value database, or key–value store, is a data storage paradigm designed for storing, retrieving, and managing associative arrays, and a data structure more commonly known today as a dictionary or hash table. Dictionaries contain a collection of objects, or records, which in turn have many different fields within them, each containing data. These records are stored and retrieved using a key that uniquely identifies the record, and is used to find the data within the database.

A table showing different formatted data values associated with different keys

Key–value databases work in a very different fashion from the better known relational databases (RDB). RDBs predefine the data structure in the database as a series of tables containing fields with well defined data types. Exposing the data types to the database program allows it to apply a number of optimizations. In contrast, key–value systems treat the data as a single opaque collection, which may have different fields for every record. This offers considerable flexibility and more closely follows modern concepts like object-oriented programming. Because optional values are not represented by placeholders or input parameters, as in most RDBs, key–value databases often use far less memory to store the same database, which can lead to large performance gains in certain workloads.[citation needed]

Performance, a lack of standardization and other issues limited key–value systems to niche uses for many years, but the rapid move to cloud computing after 2010 has led to a renaissance as part of the broader NoSQL movement. Some graph databases, such as ArangoDB,[1] are also key–value databases internally, adding the concept of the relationships (pointers) between records as a first class data type.

Types and notable examples

Key–value databases can use consistency models ranging from eventual consistency to serializability. Some support ordering of keys.

Some maintain data in memory (RAM), while others employ solid-state drives or rotating disks.

Every entity (record) is a set of key–value pairs. A key has multiple components, specified as an ordered list. The major key identifies the record and consists of the leading components of the key. The subsequent components are called minor keys. This organization is similar to a directory path specification in a file system (e.g., /Major/minor1/minor2/). The “value” part of the key–value pair is simply an uninterpreted string of bytes of arbitrary length.[2]

The Unix system provides dbm (database manager), which is a 1979 library originally written by Ken Thompson. It is also ported to Microsoft Windows, provided through programming languages such as Perl for Win32. The dbm manages associative arrays of arbitrary data by use of a single key (a primary key). Modern implementations include Berkeley DB, sdbm, and GNU dbm. Although dbm precedes the concept of a NoSQL and is rarely mentioned in modern discourse, it is used by many pieces of software.

Provider License Eventually consistent Ordered RAM Disk
Aerospike AGPL Yes Yes
Apache Ignite AL2 Yes Yes
ArangoDB AL2 Yes Yes
Berkeley DB AGPL, Proprietary Yes
CDB Public Domain
Clusterpoint Database Server Proprietary
Couchbase Server Proprietary
Dynamo Proprietary Yes
etcd AL2 Yes
FoundationDB AL2 Yes
GigaSpaces AL2, Proprietary Yes
GridGain Systems Proprietary Yes
GT.M[3] AGPL, Proprietary
Hazelcast AL2, Proprietary Yes
Hibari AL2
IBM Informix C-ISAM Proprietary Yes
immudb[4] AL2 Yes
InfinityDB Proprietary Yes
Kvrocks BSD3 Yes
Keyspace Proprietary
LevelDB BSD3 Yes
LMDB OpenLDAP (BSD-like) Yes Yes
memcached BSD3 Yes
MemcacheDB BSD Yes
Microsoft SQL Server Proprietary Yes Yes
NoSQLz freeware
Coherence Proprietary Yes
Oracle NoSQL Database AL2, Proprietary Yes
Project Voldemort AL2 Yes
Redis BSD3 Yes
Riak[5] AL2 Yes
RocksDB AL2 or GPL 2 Yes
Tarantool BSD Yes
Tkrzw AL2 Yes
Venti GPLv2, BSD Yes
OpenLink Virtuoso GPLv2, proprietary Yes Yes

See also


  1. ^ "Storage Engines". ArangoDB. Retrieved 16 November 2020.
  2. ^ Oracle NoSQL Database.
  3. ^ Tweed, Rob; James, George (2010). "A Universal NoSQL Engine, Using a Tried and Tested Technology" (PDF). p. 25. Without exception, the most successful and well-known of the NoSQL databases have been developed from scratch, all within just the last few years. Strangely, it seems that nobody looked around to see whether there were any existing, successfully implemented database technologies that could have provided a sound foundation for meeting Web-scale demands. Had they done so, they might have discovered two products, GT.M and Caché.....*
  4. ^ "Open Source key-value store with built-in cryptographic proofs". The internal transaction processing flow and cryptographic linking were specifically designed for leveraging the key-value model. It supports indexing, scanning, data-compression among other capabilities you would expect from a key-value storage. It can be embedded into any system and by following a cryptographic protocol it’s capable of ensuring immutability to any extent.
  5. ^ "Riak: An Open Source Scalable Data Store". 28 November 2010. Archived from the original on 31 December 2010. Retrieved 28 November 2010.

Edited: 2021-06-19 17:54:54