Hash indexing is sometimes used, but B-trees are more common so you can select with ORDER BY and also because you can insert additional records as many times as

Hash indexing is sometimes used, but B-trees are more common so you can select with ORDER BY and also because you can insert additional records as many times as you want, by splitting nodes now and then, but never having to rehash the whole index.