| |
Distributed Hash Sketches is a
distributed structure developed over DHTs in order
to provide a scalable load-balanced distributed
functionality like that offered by the hash sketches
as proposed by Flajolet and Martin in '85 and
Durand and Flajolet in '03. Given, a distributed
(multi-)set, DHS can efficiently and scalably
compute (in a duplicate sensitive and duplicate
insensitive) way its cardinality. This has several
key applications in several disciplines, ranging
from IR to DBs, and to network management.
The source code for the implementation of DHS over
the FreePastry DHT, coined FreeDHS, can be found
here.
|
