memdb: Efficient in memory indexed database
Modules
[Index] [Quick Jump]
Downloads
- memdb-1.0.0.3.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
| Versions [RSS] | 1.0.0.0, 1.0.0.1, 1.0.0.2, 1.0.0.3 |
|---|---|
| Change log | ChangeLog.md |
| Dependencies | base (>=4.7 && <5), bytestring, cereal, vector [details] |
| License | MIT |
| Copyright | 2018 Philip Kamenarsky |
| Author | Philip Kamenarsky |
| Maintainer | p.kamenarsky@gmail.com |
| Category | Database |
| Home page | https://github.com/pkamenarsky/memdb#readme |
| Bug tracker | https://github.com/pkamenarsky/memdb/issues |
| Source repo | head: git clone https://github.com/pkamenarsky/memdb |
| Uploaded | by pkamenarsky at 2019-07-22T13:29:23Z |
| Distributions | NixOS:1.0.0.3 |
| Downloads | 1764 total (17 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-1.0.0.3
[back to package description]memdb
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.