InterviewSolution
Saved Bookmarks
InterviewSolution
| 1. |
Structural Difference Between Bitmap And B-tree Index ? |
|
Answer» Btree It is made of branch nodes and LEAF nodes. Branch nodes holds prefix KEY value along with the link to the leaf node. The leaf node in turn contains the indexed value and rowed. Bitmap It simply consists of BITS for every single distinct value. It uses a string of bits to quickly locate rows in a table. USED to index low cardinality columns. Btree It is made of branch nodes and leaf nodes. Branch nodes holds prefix key value along with the link to the leaf node. The leaf node in turn contains the indexed value and rowed. Bitmap It simply consists of bits for every single distinct value. It uses a string of bits to quickly locate rows in a table. Used to index low cardinality columns. |
|