Output details

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

<07>This contributed the first decentralised, scalable, counter: a novel probabilistic/statistical structure for unbiased, highly-accurate estimations of distributed multi-set cardinalities. This task is fundamental to many applications, ranging from optimising query access plans in decentralised DBMSs, to computing ranks/scores in distributed IR. The paper was published at ACM TOCS: the top journal for systems research, with an impact factor of 2.39. There have been 777 downloads of this paper from the ACM DL. This is a substantial extension of a work published at the IEEE ICDE 2006 Conference (with acceptance rate of 19%), which has received a high number of citations.