vcache-trie: patricia tries modeled above VCache

[ bsd3, database, library ] [ Propose Tags ]

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.


[Skip to Readme]
Versions 0.1, 0.1.1, 0.1.2, 0.2.0, 0.2.1, 0.2.2, 0.2.3, 0.2.4
Change log changelog.md
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 Mon Oct 12 17:38:17 UTC 2015
Distributions NixOS:0.2.4
Downloads 1926 total (119 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2015-10-12 [all 1 reports]
Hackage Matrix CI

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees


Readme for vcache-trie-0.2.4

[back to package description]

Haskell VCache Trie

A Patricia trie implemented above VCache.

Suitable for database-as-a-value or modeling abstract virtual filesystems.

Currently, this only supports bytestring keys, similar to the bytestring-trie package. It may be necessary to later adapt the list-tries model to support arbitrary keys... though, not for any projects I'm pursuing at the moment.