How does the index work internally? Provide some examples in different criteria and explain...

Showing Answers 1 - 1 of 1 Answers

Asad

  • Jul 30th, 2007
 

Index are reference to data in tables's columns on what they are based. Index work exactly in way  like we have book's index describing its chapters and what page # chapter can be found.

They only contain reference to the data. There are two types on index.

B-tree index and bit map indexes.

Where data cardinality (uniqueness) is low, bitmap is good candidate for the data otherwise b-tree indexes would help. They are used to access data through reference (row-id) which is fastest method to access data on disk.

Index also affect optimizer decision as how to access data. choice of index (bitmap or b-tree) can be also dependant on application (either DSS or OLTP).

  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