News for hackers. Stuff that matters.
Re:Column – High-performance, columnar, in-memory store with... by losvedir on Monday June 21, 2021 @07:47PM (#27586061)
I've wondered about bitmap indexing before. Is it an optimization for speed, too, or just memory?

If I had an array of a million things, and I wanted to specify some large subset of them via a separate million element array (like in numpy/pandas), is it faster to do it via a million bytes or via a million bits (ie I think this is bitmap indexing, right?). I would think that the bytes would be faster, even though terribly wasteful of memory. From my rudimentary knowledge of CPUs I thought they didn't really operate at the bit level, and so you'd have to do a few instructions of calculations. Or would it be made up for by the cache line reading in more of the indexer in one fetch?

There are no comments on this comment yet.