GATE CSE
First time here? Checkout the FAQ!
x
0 votes
18 views
Why b/b+ tree used for DB index rather than AVL tree?
asked in Databases by (133 points)   | 18 views
B/B+ has larger fan out. IMO

1 Answer

+2 votes
Best answer
AVL Tree is balanced Binary Search Tree, in BST each node contains only one key so it will be a huge BST if we use it for indexing.
While in B/B++ tree a node contains many keys, the tree will have less height. Each node has the equal size to a Block size. In case of BST, I/O cost will be more because we have to fetch lots of data blocks.
answered by Boss (8.6k points)  
selected by

Related questions

+1 vote
0 answers
1
asked ago in Databases by Anuranjan Chauhan (133 points)   | 6 views
0 votes
1 answer
2
0 votes
0 answers
3


Top Users Aug 2017
  1. Bikram

    5266 Points

  2. ABKUNDAN

    4730 Points

  3. akash.dinkar12

    3514 Points

  4. manu00x

    3492 Points

  5. rahul sharma 5

    3188 Points

  6. makhdoom ghaya

    2700 Points

  7. just_bhavana

    2432 Points

  8. stblue

    2244 Points

  9. Tesla!

    2090 Points

  10. pawan kumarln

    1876 Points


25,071 questions
32,224 answers
75,102 comments
30,232 users