B-trees are basically the only sane option if you ever need to do range queries....

		dfranke on July 8, 2008 \| parent \| context \| favorite \| on: B-Trees - Balanced Search Trees for Slow Storage B-trees are basically the only sane option if you ever need to do range queries. Hash tables tend to outperform them a bit on all other operations.