Bit strings variations

[Konard]

In addition to bit string itself. We can have a smaller bit string that represent a bitmap with each 1 bit corresponding to N bits in original bit string.

This way for example in a bitmap for bit string we can use a single bit to know that 8 bits in the original bit string are either all 0 or one of them are set. Granulary can correlate with processor cache line or system page.

We also can use an array of sectors with a system page size. Each sector can either have 0 (sector is empty), or index/address of bit string sector on disk. This way we not only optimize search in bit string, we also save actual space on disk, and using such technique we can fill bit string in random order.