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...

An Ordered Key-Value Store (OKVS) is a type of data storage paradigm that can support multi-model database. An OKVS is an ordered mapping of bytes to bytes...

core database exposes an ordered key–value store with transactions. The transactions are able to read or write multiple keys stored on any machine in the...

WiredTiger is a NoSQL, open source extensible platform for data management. It is released under version 2 or 3 of the GNU General Public License. WiredTiger...

LevelDB is an open-source on-disk key-value store written by Google fellows Jeffrey Dean and Sanjay Ghemawat. Inspired by Bigtable, LevelDB source code...

associative array, key-value store, map, symbol table, or dictionary is an abstract data type that stores a collection of (key, value) pairs, such that...

RocksDB is a high performance embedded database for key-value data. It is a fork of Google's LevelDB optimized to exploit multi-core processors (CPUs)...

Tkrzw is a library of routines for managing key–value databases. Tokyo Cabinet was sponsored by the Japanese social networking site Mixi, and was a multithreaded...

implemented as an extension of it. The key–value model can be extended to a discretely ordered model that maintains keys in lexicographic order. This extension...

used to store and retrieve strings from a dictionary or set. Unlike a binary search tree, nodes in a trie do not store their associated key. Instead...

and is available open-source under an MIT license. LevelDB is an ordered key/value store created by Google as a lightweight implementation of the Bigtable...

individual key–value pairs under radix nodes and hash buckets into an associative array. Unlike a simple hash table, HAT-tries store key–value in an ordered collection...

keys (not key–value pairs), and to which an additional level is added at the bottom with linked leaves. The primary value of a B+ tree is in storing data...

the desired value can be found. During lookup, the key is hashed and the resulting hash indicates where the corresponding value is stored. A map implemented...

root keys. Registry values are name/data pairs stored within keys. Registry values are referenced separately from registry keys. Each registry value stored...

Redis (/ˈrɛdɪs/; Remote Dictionary Server) is an in-memory key–value database, used as a distributed cache and message broker, with optional durability...

Bitcask is an Erlang application that provides an API for storing and retrieving key/value data into a log-structured hash table. The design owes a lot...

and real-valued sequences. A current axiomatic definition is that real numbers form the unique (up to an isomorphism) Dedekind-complete ordered field. Other...

largest key value not exceeding v", "find all items with key values between specified bounds vmin and vmax". In certain databases the key values may be...

algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values). It was first described by W...

Scramble the bits of the key so that the resulting values are uniformly distributed over the keyspace, and Map the key values into ones less than or equal...

second loop) to store the positions where items with each key should be placed, k is the maximum value of the non-negative key values and output is the...

Digital data are often stored in relational databases, like tables or SQL databases, and can generally be represented as abstract key/value pairs. Data can be...

C++ programming language that implement ordered associative arrays. Being templates, they can be used to store arbitrary elements, such as integers or...

right subarray ([7, 8, 9, 10, 11]) is 9. Uniform binary search would store the value of 3 as both indices differ from 6 by this same amount. To reduce the...

C, then the key (the value) of P is greater than or equal to the key of C. In a min heap, the key of P is less than or equal to the key of C. The node...

maintain a dynamic set of ordered keys and allow binary searches among the keys. After any sequence of insertions and deletions of keys, the shape of the tree...

O(log log M), using O(n) space, where n is the number of stored values and M is the maximum value in the domain. The structure was proposed by Dan Willard...

In computer science, a set is an abstract data type that can store unique values, without any particular order. It is a computer implementation of the...

headquartered in Woonsocket, Rhode Island. Originally named the Consumer Value Stores, it was founded in Lowell, Massachusetts, in 1963. The chain was...