most citedKey Compression Limits for -Minimum Value Sketches

1 citations · 1 across the 2 of their papers we have counts for

collaborators
Showing cs.DSShow all

2 papers · 1 filter

cs.DS2024★ 1 cited

Key Compression Limits for -Minimum Value Sketches

Charlie Dickens, Eric Bax, Alexander Saydakov

The -Minimum Values (\kmv) data sketch algorithm stores the least hash keys generated by hashing the items in a dataset. We show that compression based on ordering the keys…

cs.DS2023

Matching Noisy Keys for Obfuscation

Charlie Dickens, Eric Bax

Data sketching has emerged as a key infrastructure for large-scale data analysis on streaming and distributed data. Merging sketches enables efficient estimation of cardinalities a…