Data-Hash-Consistent: Provide a simple consistent hashing mechanism

[ bsd3, data, library ] [ Propose Tags ]

Provide a simple consistent hashing mechanism


[Skip to Readme]

Modules

[Index]

Flags

Automatic Flags
NameDescriptionDefault
splitbase

Choose the new smaller, split-up base package.

Enabled

Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.1.0, 0.1.1
Dependencies base (>=3 && <6), bytestring, digest, utf8-string, vector, vector-algorithms [details]
License BSD-3-Clause
Author brad clawsie
Maintainer haskell@fastmail.fm
Category Data
Home page https://github.com/bradclawsie/haskell-Data.Hash.Consistent
Uploaded by BradClawsie at 2012-11-20T04:22:01Z
Distributions NixOS:0.1.1
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 2316 total (17 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]

Readme for Data-Hash-Consistent-0.1.1

[back to package description]

haskell-Data.Hash.Consistent

Data.Hash.Consistent

A consistent hash is a technique to manage the fair distribution of cacheable entities among hosts. Each host identifier has its crc32 hash calculated and stored in a Vector along with its canonical host name. The host identifier may be differentiated from its canonical host name by a multiplying factor, in our case a simple integer appeneded to the hostname to provide it with a number of entries in the consistent hash, all evenly distributed.

This technique is explained in these links:

http://en.wikipedia.org/wiki/Consistent_hashing

http://www.tomkleinpeter.com/2008/03/17/programmers-toolbox-part-3-consistent-hashing/