Summarizing data using bottom-k sketches

DOI10.1145/1281100.1281133zbMath1283.68086OpenAlexW1979819093MaRDI QIDQ5401415

Edith Cohen, Haim Kaplan

Publication date: 13 March 2014

Published in: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1281100.1281133

zbMATH Keywords

data streamsall-distances sketchesbottom-\(k\) sketches

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Data structures (68P05) Distributed systems (68M14)

Related Items

d-k-min-wise independent family of hash functions ⋮ Optimal sampling from sliding windows ⋮ Algorithms and estimators for summarization of unaggregated data streams ⋮ Fingerprints for highly similar streams ⋮ In-network estimation of frequency moments ⋮ Exponential time improvement for min-wise based algorithms ⋮ Unnamed Item