GeekInterview.com
   Home |  Tech FAQ  |   Interview Questions |  Placement Papers |  Tech Articles |  Learn |  Freelance Projects |  Online Testing |  Geeks Talk |  Job Postings |  Knowledge Base | Site Search |  Add/Ask Question

  GeekInterview.com  >  Interview Questions  >  Oracle  >  Concepts and Architecture

 Print  |  
Question:  What is the diff b/w BTREE INDEX and BITMAP INDEX



July 07, 2006 11:44:09 #1
 jiawei wang   Member Since: Visitor    Total Comments: N/A 

RE: What is the diff b/w BTREE INDEX and BITMAP INDEX
 
bitmap indexes are more advantageous than b-tree indexes when the table has millions of rows and the key columns have low cardinality. bitmap indexes provide better performance than b tree indexes when queries often use a combination of multiple where conditions involving the OR operator, the table is read-only, or when there is low update activity on the key columns.
     

 

Back To Question