First time here? Checkout the FAQ!
0 votes
Why b/b+ tree used for DB index rather than AVL tree?
asked in Databases by (165 points) 5 | 23 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 Veteran (15.8k points) 6 20 58
selected by

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Top Users Oct 2017
  1. Arjun

    23684 Points

  2. Bikram

    17288 Points

  3. Habibkhan

    9188 Points

  4. srestha

    6486 Points

  5. Debashish Deka

    5478 Points

  6. jothee

    5148 Points

  7. Sachin Mittal 1

    4910 Points

  8. joshi_nitish

    4492 Points

  9. sushmita

    4078 Points

  10. Rishi yadav

    3998 Points

Recent Badges

Nice Answer bhupalreddy
Medalist bhupalreddy
Old-Timer Kushal06
Notable Question akankshadewangan24
Good Question the.brahmin.guy
Good Answer Arjun
Revival Arjun
Nice Comment Arjun
Verified Human gunjan79
Great Answer Arjun
27,422 questions
35,273 answers
33,511 users