key-value pair


Also found in: Dictionary, Thesaurus, Medical, Financial.

key-value pair

An item of data that is identified by an arbitrary name. The key is the name, and the value is the content; for example, the key might be CITY, and the value might be CHICAGO. A key-value database is a set of key-value pairs.

Variables Are Key-Values
A variable in a program is also a key-value pair that is initiated by a statement such as int counter=0, which is a C/C++ example that defines an integer named COUNTER (the key) with a value of zero. See variable, hash table, lookup table and configuration file.
References in periodicals archive ?
Because the Hadoop framework does not define the class associated with the image as the data type of the key-value pair <key, value> and because the Hadoop framework specifies that a user-defined data type can only be used by implementing the Writable interface, this study defines the data type RawImage and rewrites the basic input and output method defined by the Writable interface in Hadoop.
Therefore, when an atomic attack is initiated, the attack probability of all the front nodes is evaluated, and the value is the cumulative reachable probability of the first resource state node in the key-value pair. Then, we can calculate the cumulative reachable probability of current action node.
Each Combiner function receives the set of <id, <d, c[much greater than] pairs with the same key (i.e., record id), and then sorts the key-value pairs by the distance in ascending order.
In the map matching experiment, we preload both KELI and RDMA-Memcached with about six million key-value pairs represent the geographical information of Ho Chi Minh City.
Key-Value pair for the MapReduce example Key Value engineSpeed Signal values airFlowRate Signal values
designed the LEEN algorithm [5] to determine the corresponding partition of a map output based on the frequency of key-value pairs. When a large amount of data and keys are unevenly distributed, data skew may occur, resulting in an unbalanced input of reduce tasks.
Structuring information about the city means that the entire document is divided up into a series of hierarchically organised, short statements that are entirely made up of key-value pairs. According to this structure, two different objects are associated with one another in a data structure that can be extended without changing any of the underlying objects.
The compression may be improved by using a key-value pair system with a variable number of bits and using a Dynamic Huffman Algorithm.
The Reduce task gathers the list rid and graph s for the key sid and then outputs the key-value pair {rid, s).
Despite all the differences, localStorage and sessionStorage record the data in the form of key-value pairs. Depending on the amount of data collected and the number of operations, the stored key and value pairs are incremented.
The mappers are user-defined programs (UDPs), which prepare data and perform calculations, if needed, and then send the processed data (key-value pairs) to the reducers.
Furthermore, MemSQL supports the ingestion of unstructured and semi-structured (JSON) data into key-value pairs. Full ANSI SQL support makes MemSQL readily accessible to data analysts, business analysts and data scientists reducing application code requirements.