vcache-trie: patricia tries modeled above VCache
VCache supports larger-than-memory values with caching, persistence, and structure sharing. Effective use of VCache requires useful data structures be modeled above it. The trie is useful for modeling key value databases or abstract virtual filesystems, where keys have shared prefixes or elements with a common prefix are likely to be updated together.
Currently, the implementation is specialized to a bytestring trie.
Downloads
- vcache-trie-0.1.1.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] | 0.1, 0.1.1, 0.1.2, 0.2.0, 0.2.1, 0.2.2, 0.2.3, 0.2.4 |
|---|---|
| Dependencies | array, base (>=4.6 && <5), bytestring, bytestring-builder, vcache (>=0.2.3) [details] |
| License | BSD-3-Clause |
| Copyright | (c) 2015 by David Barbour |
| Author | David Barbour |
| Maintainer | dmbarbour@gmail.com |
| Category | Database |
| Home page | http://github.com/dmbarbour/haskell-vcache-trie |
| Source repo | head: git clone http://github.com/dmbarbour/haskell-vcache.git |
| Uploaded | by dmbarbour at 2015-03-09T13:41:10Z |
| Distributions | |
| Reverse Dependencies | 1 direct, 0 indirect [details] |
| Downloads | 4587 total (20 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2015-03-09 [all 1 reports] |