What is a HASH INDEX and how does it compare to other indexes?

Questions by KPIZME   answers by KPIZME

Showing Answers 1 - 1 of 1 Answers

opbang

  • Sep 23rd, 2006
 

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.

  Was this answer useful?  Yes

Give your answer:

If you think the above answer is not correct, Please select a reason and add your answer below.

 

Related Answered Questions

 

Related Open Questions