by Kerollmops on 12/24/23, 8:16 AM with 26 comments
by goestoo on 12/24/23, 4:51 PM
by ko_pivot on 12/24/23, 2:49 PM
by marginalia_nu on 12/24/23, 11:24 PM
Interesting. Could you elaborate on the benefit of this?
I've (possibly prematurely) discarded the notion of using RoaringBitmaps like this because while they use less memory, traversal is and mutation is so much slower using a fixed buffer out of a pool and considering an upper bounded slice of putative results at a time.
Although this is for a search engine that typically deals with under-specified queries and is designed for best-effort retrieval given an upper computation time.
by wg0 on 12/24/23, 9:35 PM
by darkotic on 12/24/23, 11:04 PM
by sgt101 on 12/24/23, 1:52 PM