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

What do you know about normalization? Explain in detail?

0 Answers  


What are the uses of a database trigger?

0 Answers  


select * from emp what happened internally when we write this query in the sql prompt?

5 Answers  


What happens to indexes if you drop a table?

0 Answers  


Explain the use of show option in imp command.

0 Answers  






How to define an external table with a text file?

0 Answers  


How to bring a tablespace offline?

0 Answers  


Can we create more than one index on particular column?

1 Answers  


What is meant by recursive hints in oracle?

0 Answers  


select statement does not retrieve any records. what exception is raised?

2 Answers  


How to create a table index?

0 Answers  


Explain can a view based on another view?

1 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)