A  Hash index stores key value pairs based on a pseudo randomizing function called hash function

A B+- Tree is a balanced tree whose leaves contain a sequence of key pointer pairs.

- Use a hash index for point queries only. Use a B- Tree if multipoint queries or range queries are used.