So a bitmap index requires a bit per unique value IIRC (plus the key and some am... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		boyd on May 22, 2024 \| parent \| context \| favorite \| on: Show HN: B-field, a novel probabilistic key-value ... So a bitmap index requires a bit per unique value IIRC (plus the key and some amount of overhead). So for ~32 unique values you're already at 4 bytes, 40 bytes per key-value pair for 320 values, etc. In comparison, a B-field will let you store 32 distinct values at ~3.4 bytes (27 bits) per key-value pair at a 0.1% FP rate.

foota on May 22, 2024 [–]

Yes, I'm not claiming that they're going to perform as well, just that they're sort of similar in the space of problems.

There's different techniques used for compressing them, mostly around sorting the keys and e.g., run length encoding the values.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact