Tag
bitmaps
- Oct 20, 2026 fsck and the Ordering of Repairs Why the consistency passes run in a fixed order, how each pass builds the data the next one needs, and why some findings can only be resolved by discarding data. filesystems
- Jul 1, 2026 Bitmap Memory and the Cost of Decoding at Full Resolution The byte arithmetic behind image memory, why a decode allocates more than the file size, and how sample size and format conversion change both the footprint and the time. mobile computing
- Apr 8, 2026 Child Representation and the Branching Factor Problem in Tries A trie costs one child lookup per key byte, so the node layout decides memory and speed. Compares dense arrays, sorted and linked child lists, bitmaps with rank, and double-array layouts. data structures
- May 20, 2025 Block Groups and the Cost of Metadata Locality Why a filesystem carves itself into groups with their own bitmaps and inode tables, what the descriptor table records, and how allocation policy turns locality into seek distance. filesystems
- Mar 25, 2025 Bitmap and Roaring Indexes for Combining Predicates How one bit per document per value makes conjunctions word-parallel, why the space cost forces chunked container formats, and where the crossover thresholds sit. algorithms