# Tag Info

Accepted

• 11.1k
1 vote
Accepted

### Single-pass streaming quantile estimation using moments

Gan et al. address this in Moment-Based Quantile Sketches for Efficient High Cardinality Aggregation Queries. The answers are rather nuanced.
• 11.1k
1 vote

### Sketches, using ideal hash functions

Another reason for not using cryptographic algorithms in practice is speed. In the streaming setting, we typically do not want to spend too long processing each item in the stream. Computing k ...
• 111
1 vote

### Sketches, using ideal hash functions

The obvious problem is that if you use a cryptographic pseudorandom number generator (PRNG), the correctness of your algorithm is conditional on a complexity conjecture. However, usually this can be ...
• 18.1k

Only top scored, non community-wiki answers of a minimum length are eligible