The Database Primitives Library contains a number
of function suites intended to facilitate the
design and building of in-memory databases.
Originally created with IRC servers in mind, the
library provides simple linked lists with
arbitrary ordering, hash tables which can
optionally be automatically resized,
memory-efficient sparse matrices based on the
linked lists and hash tables, and an
implementation of red-black trees. Other database
primitives may be added in the future, if needed.
