1 Berkeley DB is an embeddable database system that supports keyed access to
2 data. The software is distributed in source code form, and developers can
3 compile and link the source code into a single library for inclusion
4 directly in their applications.
6 Developers may choose to store data in any of several different storage
7 structures to satisfy the requirements of a particular application. In
8 database terminology, these storage structures and the code that operates on
9 them are called access methods. The library includes support for the
10 following access methods:
12 * B+tree: Stores keys in sorted order, using either a programmer-supplied
13 ordering function or a default function that does lexicographical
14 ordering of keys. Applications may perform equality or range searches.
15 * Hashing: Stores records in a hash table for fast searches based on
16 strict equality. Extended Linear Hashing modifies the hash function
17 used by the table as new records are inserted, in order to keep buckets
18 underfull in the steady state.
19 * Fixed and Variable-Length Records: Stores fixed- or variable-length
20 records in sequential order. Record numbers may be immutable or
21 mutable, i.e., permitting new records to be inserted between existing
22 records or requiring that new records be added only at the end of the