structural difference between bitmap and btree index ?
Answer Posted / sandeep desai
B-Tree:-Is made of Branch nodes and Leaf nodes
where
Branch nodes hold the prefix key value and also the link to
Leaf node
whereas,
Leafe node is contains Indexed value and ROWID.
Bitmap:-It consists of the bits for every distinct value
| Is This Answer Correct ? | 10 Yes | 3 No |
Post New Answer View All Answers
What is the difference between alert log file and tarce file ?
What is archive log in Oracle?
How to save query output to a local file?
What are the uses of a database trigger?
Is there a combination of "like" and "in" in sql?
What are the major difference between truncate and delete?
i have a question here... As of my knowledge, when we apply an index (b-tree)on a column, internally it arranges the data in b-tree format and do the fetching process correspondingly... and my quetion is... How a bit-map index arranges the data internally when applied on a column?IS it in b-tree format or whatelse?
How to define a variable of a specific record type?
What is a user account in oracle?
How do we get field details of a table?
What is recovery manager(rman) backup in Oracle?
Why should I use oracle database?
How do we display rows from the table without duplicates?
What is an oracle table?
How many file formats are supported to export data?