I explain why ID generation is an issue, how it can be achieved in a reliable, scalable manner. I show how it is done and also analyze the constraints, risks and considerations one has to take while designing a solution for this problem.

I pick a solution and present some benchmarks for it and other substitudes in the second part.

This page documents the time-complexity (aka "Big O" or "Big Oh") of various operations in current CPython.

interpolation search

As a contribution to the recent debate on simple implementations of dictionaries, we present new maintenance algorithms for balanced trees. In terms of code simplicity, our algorithms compare favourably with those for deterministic and probabilistic skip lists.

Andersson trees are simple and easy to implement balanced binary search trees that are based on the foundations of red black trees. Consequently, Andersson trees have similar performance and structuring properties as red black trees without the difficult implementation.

Paper on the technique Shazam (et al?) uses for music recognition.