datastructures

In a previous post I discussed linked lists versus arrays, and ran a number of simple benchmarks with both structures to demonstrate that the common advice of “use linked lists for insertion heavy workloads” doesn’t always pan out in practice.

The execution of analytical queries on massive datasets presents challenges due to long response times and high computational costs. As …

When talking about data structures, I often like to say that there are two basic ones: arrays and linked lists. These two structures accomplish the same task: storing a sequence of items. But one of them is significantly better in most situations.

A bit array is a simple data structure that allows you to compactly represent an array of booleans, but constructing one requires some low-level binary manipulations that you may not be familiar with. Let’s walk through the basic principles, and mock up a simple example of a bit array.