Summarizing data using bottom-k sketches
From MaRDI portal
Publication:5401415
DOI10.1145/1281100.1281133zbMath1283.68086MaRDI QIDQ5401415
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
68M10: Network design and communication in computer systems
68P05: Data structures
68M14: Distributed systems
Related Items
Unnamed Item, d-k-min-wise independent family of hash functions, Optimal sampling from sliding windows, Fingerprints for highly similar streams, In-network estimation of frequency moments, Exponential time improvement for min-wise based algorithms, Algorithms and estimators for summarization of unaggregated data streams