Distributed hash sketches: Scalable, efficient, and accurate cardinality estimation for distributed multisets

@article{Ntarmos2009DistributedHS,
  title={Distributed hash sketches: Scalable, efficient, and accurate cardinality estimation for distributed multisets},
  author={Nikos Ntarmos and Peter Triantafillou and Gerhard Weikum},
  journal={ACM Trans. Comput. Syst.},
  year={2009},
  volume={27},
  pages={2:1-2:53}
}
Counting items in a distributed system, and estimating the cardinality of multisets in particular, is important for a large variety of applications and a fundamental building block for emerging Internet-scale information systems. Examples of such applications range from optimizing query access plans in peer-to-peer data sharing, to computing the significance (rank/score) of data items in distributed information retrieval. The general formal problem addressed in this article is computing the… CONTINUE READING
Highly Cited
This paper has 26 citations. REVIEW CITATIONS
14 Citations
10 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 14 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 10 references

Similar Papers

Loading similar papers…