61 points mfrw 1 day ago 7 comments
jpitz 1 day ago | parent
ncruces 1 day ago | parent
https://pkg.go.dev/github.com/ncruces/go-sqlite3/ext/approx
They work as window functions, and they also support creating roll-up tables, e.g. you have a table storing a sketch of daily active users and can use that to get weekly and monthly active users.
Same for quantiles (e.g. median and tail latencies) and next up top-K (e.g. most popular content, highest spenders, etc).
donatj 22 hours ago | parent
kristianp 20 hours ago | parent
> Unsure uses a blocked Bloom filter. The bit array is divided into 512-bit blocks, each matching the size of a CPU cache line. When you add or check an item, it is hashed once: part of the hash selects a block, and the rest selects k bits within that block.
The article also has a good quality list of references.
mfrw 16 hours ago | parent