© Vsevolod Domkin 2021
V. DomkinProgramming Algorithms in Lisphttps://doi.org/10.1007/978-1-4842-6428-7_7

7. Key-Values

Vsevolod Domkin1  
(1)
Kyiv, Ukraine
 
../images/502489_1_En_7_Chapter/502489_1_En_7_Figa_HTML.png

To conclude the description of essential data structures, we need to discuss key-values (kvs), which are the broadest family of structures one can imagine. Unlike arrays and lists, kvs are not concrete structures. In fact, they span, at least in some capacity, all of the popular concrete ones, as well as some obscure.

The main feature of kvs is efficient access to the values by some kind of keys that they are associated with. In other words, each element of such data structure is a key-value pair ...

Get Programming Algorithms in Lisp: Writing Efficient Programs with Examples in ANSI Common Lisp now with O’Reilly online learning.

O’Reilly members experience live online training, plus books, videos, and digital content from 200+ publishers.