Latest News

Monday, December 11, 2017

Difference between b-tree and bitmap index

A bitmap and a btree indexes are used to retrieve rows faster than a full-table scan.  

Below are the basic differences between b-tree and bitmap indexes :

1:  Syntax of bitmap and a B-tree indexes:  
  • The bitmap index includes the "bitmap" keyword.  
  • The btree index does not say "bitmap"

2: Cardinality differences:  
  • The bitmap index is generally for low cardinality columns (Columns with duplicate values )
  • while b-tree indexes are best for high cardinality columns.

3: Internal structure differences:  
  • A B-tree index has index nodes (based on data block size), it like a tree form


  • A bitmap index looks like this, a two-dimensional array with zero and one (bit) values







  • Google+
  • Pinterest
« PREV
NEXT »

1 comment

  1. Watch and Download world's famous drama series Kurulus Osman in English on link below
    👇
    Kurulus Osman in English

    📢Get high quality backlinks for your
    Website with BacklinksIndexer
    BacklinksIndexer

    Crypto trading online course
    Join on link below
    Crypto quantum leap

    📒 Read Home doctor book online
    Then you will be a doctor for your family
    Home Doctor Book

    💰Create own NFTs and earn 1000$
    Complete guide
    Create NFT

    Join online YouTube course
    And be a professional YouTuber
    Tube Mastery and Monetization by matt

    🦷Steel Bite Pro
    Best product for
    Teeth pain, cavities,teeth whitening and other oral health issues with money back guarantee
    Steel Bite Pro

    ReplyDelete