Key–Value Stores
Abstract
The key–value store model uses a key to locate a value of some kind. That value can be traditional data, BLOBs, files, or anything that can be put into computer storage. Likewise, the key can be accessed by hashing, indexing, brute-force scans, or any other appropriate method. This is the most primitive model for data retrieval short of a pile of unorganized data. It is not intended for queries, as all it can do is insert, update, delete, and retrieve (or return a “not found” message). The Berkeley database is the most popular open-source product of this type. Any meaning attached to the values comes from the host program as there is no schema to define anything.
Keywords
BDB (Berkeley database); BLOB; CLOB; ...
Get Joe Celko’s Complete Guide to NoSQL now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
