Explain the structural difference between bitmap and b-tree index.
| Bitmap | B-tree Index |
|---|---|
| Bitmap consists of bits for every particular single value. | Bitmap consists of branch nodes and leaf nodes. |
| It uses strings to locate elements of tables (rows and columns) | It helps to keep the data sorted and arranged in DBMS. |
Related Article Linkedin Interview Questions
BY Best Interview Question ON 25 Oct 2019