memdb: Efficient in memory indexed database

[ database, library, mit ] [ Propose Tags ]

Please see the README on GitHub at

[Skip to Readme]


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


  • No Candidates
Versions [RSS],,,
Change log
Dependencies base (>=4.7 && <5), bytestring, cereal, vector [details]
License MIT
Copyright 2018 Philip Kamenarsky
Author Philip Kamenarsky
Category Database
Home page
Bug tracker
Source repo head: git clone
Uploaded by pkamenarsky at 2019-07-22T13:29:23Z
Distributions NixOS:
Downloads 1687 total (15 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2019-07-22 [all 1 reports]

Readme for memdb-

[back to package description]



This package contains a thin wrapper over a continous memory region combined with an efficient reverse index implementation for fast and type-safe indexed lookups.

It is aimed at storing, loading and querying big immutable datasets. Once written, a database can not be modified further.

The underlying storage is pinned and thus ensures efficient garbage collection without ever reading the structure contents, since no pointers live inside the dataset that point outside it.