Key-value database

key-value storekey-valuekey/valuedistributed key-value databasedistributed key-value storekey value storageKey Value StoreKey/Value databaseKV storagestores keys
A key-value database, or key-value store, is a data storage paradigm designed for storing, retrieving, and managing associative arrays, a data structure more commonly known today as a dictionary or hash table.wikipedia
84 Related Articles

Database

database management systemdatabasesdatabase systems
These records are stored and retrieved using a key that uniquely identifies the record, and is used to quickly find the data within the database.
The next generation of post-relational databases in the late 2000s became known as NoSQL databases, introducing fast key-value stores and document-oriented databases.

Graph database

graph databasesgraphgraph data processing
Some graph databases are also key-value databases internally, adding the concept of the relationships (pointers) between records as a first class data type.
Others use a key-value store or document-oriented database for storage, making them inherently NoSQL structures.

Redis

logging database updates for persistence
Redis was the most popular implementation of a key-value database as of August 2015, according to DB-Engines ranking.
Redis ( Remote Dictionary Server) is an open-source in-memory data structure project implementing a distributed, in-memory key-value database with optional durability.

Oracle NoSQL Database

Oracle NoSQL
Another example of key-value database is Oracle NoSQL Database.
Oracle NoSQL Database is a NoSQL-type distributed key-value database from Oracle Corporation.

NoSQL

structured storagekey/value storenon-relational
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.
Key-value: Aerospike, Apache Ignite, ArangoDB, Berkeley DB, Couchbase, Dynamo, FoundationDB, InfinityDB, MemcacheDB, MUMPS, Oracle NoSQL Database, OrientDB, Redis, Riak, SciDB, SDBM/Flat File dbm, ZooKeeper

Voldemort (distributed data store)

Voldemort
Project Voldemort
Voldemort is a distributed data store that was designed as a key-value store used by LinkedIn for highly-scalability storage.

Berkeley DB

BDBBerkeley DatabaseBerkeleyDB
Berkeley DB
Berkeley DB (BDB) is a software library intended to provide a high-performance embedded database for key/value data.

Associative array

mapdictionariesdictionary
A key-value database, or key-value store, is a data storage paradigm designed for storing, retrieving, and managing associative arrays, a data structure more commonly known today as a dictionary or hash table.
These key-value stores have been used for many years and have a history as long as that as the more common relational database (RDBs), but a lack of standardization, among other reasons, limited their use to certain niche roles.

Lightning Memory-Mapped Database

LMDBLightningDB
LMDB
Lightning Memory-Mapped Database (LMDB) is a software library that provides a high-performance embedded transactional database in the form of a key-value store.

FoundationDB

FoundationDB
The core database exposes an ordered key-value store with transactions.

RocksDB

MyRocks
RocksDB (fork of LevelDB)
RocksDB is a high performance embedded database for key-value data.

Couchbase Server

CouchbaseMembase
Couchbase Server
Membase was developed by several leaders of the memcached project, who had founded a company, NorthScale, to develop a key-value store with the simplicity, speed, and scalability of memcached, but also the storage, persistence and querying capabilities of a database.

Tokyo Cabinet and Kyoto Cabinet

Tokyo Cabinet and Kyoto Cabinet
Tokyo Cabinet and Kyoto Cabinet are two libraries of routines for managing key-value databases.

Dbm

GDBMsdbm
The Unix system provides dbm (database manager) which is a library originally written by Ken Thompson.
Key-value database

Data structure

data structuresstructurestructures
A key-value database, or key-value store, is a data storage paradigm designed for storing, retrieving, and managing associative arrays, a data structure more commonly known today as a dictionary or hash table.

Hash table

hash tableshashhashes
A key-value database, or key-value store, is a data storage paradigm designed for storing, retrieving, and managing associative arrays, a data structure more commonly known today as a dictionary or hash table.

Collection (abstract data type)

collectioncontainercontainers
Dictionaries contain a collection of objects, or records, which in turn have many different fields within them, each containing data.

Object (computer science)

objectobjectsdata object
Dictionaries contain a collection of objects, or records, which in turn have many different fields within them, each containing data.

Record (computer science)

recordrecordsstructures
Dictionaries contain a collection of objects, or records, which in turn have many different fields within them, each containing data.

Field (computer science)

fieldsfielddata fields
Dictionaries contain a collection of objects, or records, which in turn have many different fields within them, each containing data.

Relational database

relational databasesrelationaldatabase constraints
Key-value databases work in a very different fashion from the better known relational databases (RDB).

Data type

typedatatypetypes
RDBs pre-define the data structure in the database as a series of tables containing fields with well defined data types.

Object-oriented programming

object-orientedobject orientedobject-oriented programming language
This offers considerable flexibility and more closely follows modern concepts like object-oriented programming.