/explore
|
You are here 
|
quickwit.io | ||
| | | | |
richardstartin.github.io
|
|
| | | | | This article is an introduction to the data structures found in theRoaringBitmaplibrary, which I have been making extensive use of recently. I wrote some time ago about the basic idea of bitmap indices, which are used in various databases and search engines, with the caveat thatno traditionalimplementation is optimal across all data scenarios(in terms of size of the data set, sparsity, cardinalitiesof attributes and global sort orders of data sets with respect to specific attributes). RoaringBitmap is a dynamic data structure which aimsto be that one-size-fits-all solution across all scenarios. | |
| | | | |
blog.spiraldb.com
|
|
| | | | | Random access string compression with FSST and Rust | |
| | | | |
denvaar.dev
|
|
| | | | | [AI summary] An article explaining the theory and implementation of computing rank in bit arrays using succinct data structures to achieve constant time and sub-linear space complexity. | |
| | | | |
amatriain.net
|
|
| | | |||
