The btree-concurrent package

[Tags: lgpl, library]

A backend agnostic, concurrent BTree


[Skip to ReadMe]

Properties

Versions0.1.0, 0.1.1, 0.1.3, 0.1.4, 0.1.5
Change logNone available
Dependenciesarray (==0.4.*), base (==4.*), base64-bytestring (==1.*), bytestring (>=0.9), cereal (>=0.3), containers (>=0.5), directory (==1.*), filepath (==1.*), hashable (==1.*), mtl (==2.*), random (==1.*), snappy (==0.2.*), stm (==2.2.*), time (==1.*) [details]
LicenseLGPL
AuthorMorten Brøns, Johan Brinch
Maintainerbrinchj@gmail.com
StabilityExperimental
CategoryData Structures
Home pagehttps://github.com/brinchj/btree-concurrent
Source repositoryhead: git clone https://github.com/brinchj/btree-concurrent.git
UploadedWed Oct 31 13:09:44 UTC 2012 by JohanBrinch
Downloads847 total (50 in last 30 days)
Votes
0 []
StatusDocs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees

Readme for btree-concurrent-0.1.5

btree-concurrent

A backend agnostic, concurrent BTree with relaxed balance[1] written in Haskell using a mix of IO operations and pure STM.

Although the code does work, it is neither production-ready nor complete.

Features include:

Deficients include:

[1] B-trees with relaxed balance, K. S. Larsen & R. Fagerberg, Parallel Processing Symposium, 1995. Proceedings., 9th International