Initially question was asked to mention the types of indexes.
Then asked about BITMAP INDEX and B-Tree Index

Answer Posted / brajesh kr.

Bitmap:- index is special kind of index that uses bitmap .
it significant space and performance advantage over
structure for such data. it is also useful for unique value
data. it use bit arrays and answer queries by performing
bitmap logical operations on these bitmap.

B-Tree:-databse server uses a b-tree strucruyre to organize
index information shows that afully developed b-treee index
is composed of that following
1.Oneroot nodes
2. Two or more branch nodes.

Is This Answer Correct ?    1 Yes 5 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

What are schema-level triggers?

570


what are the different type of normalization? : Sql dba

542


What does count (*) mean?

516


What is the difference between nvl function, ifnull function, and isnull function?

581


what is a database transaction? : Sql dba

573






What is the most important ddl statements in sql are?

513


What is mutating error in pl sql?

534


Is inner join faster than left join?

619


Explain what is dbms?

571


What is sql table?

513


what is the difference between sql and t-sql? : Transact sql

587


Why cannot I use bind variables in ddl/scl statements in dynamic sql?

653


What is the primary use of normalization?

511


Explain about various levels of constraint.

515


What is rollback?

570