structural difference between bitmap and btree index ?



structural difference between bitmap and btree index ?..

Answer / 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

More Oracle General Interview Questions

How to define an oracle sub procedure?

0 Answers  


How to divide query output into groups in oracle?

0 Answers  


Which of the following is not a database object TABLESPACE TABLE INDEX NONE

1 Answers  


How to update a table row with a record?

0 Answers  


How to define an anonymous block?

0 Answers  






List the types of joins used in writing subqueries?

0 Answers  


who is the father of oracle and send chodd rules

4 Answers   ME,


What is difference between Rename and Alias?

1 Answers  


What is a system tablespace?

0 Answers  


How to delete multiple rows from a table in oracle?

0 Answers  


Is oracle an open source?

0 Answers  


What is the difference between count (*), count (expression), count (distinct expression)?

0 Answers  


Categories
  • Oracle General Interview Questions Oracle General (1789)
  • Oracle DBA (Database Administration) Interview Questions Oracle DBA (Database Administration) (261)
  • Oracle Call Interface (OCI) Interview Questions Oracle Call Interface (OCI) (10)
  • Oracle Architecture Interview Questions Oracle Architecture (90)
  • Oracle Security Interview Questions Oracle Security (38)
  • Oracle Forms Reports Interview Questions Oracle Forms Reports (510)
  • Oracle Data Integrator (ODI) Interview Questions Oracle Data Integrator (ODI) (120)
  • Oracle ETL Interview Questions Oracle ETL (15)
  • Oracle RAC Interview Questions Oracle RAC (93)
  • Oracle D2K Interview Questions Oracle D2K (72)
  • Oracle AllOther Interview Questions Oracle AllOther (241)