AVL tree vs. B-tree

data-structures b-tree avl-tree
neuromancer picture neuromancer · Apr 29, 2010 · Viewed 43.8k times · Source

How is an AVL tree different from a B-tree?

Answer

David picture David · Apr 29, 2010

AVL trees are intended for in-memory use, where random access is relatively cheap. B-trees are better suited for disk-backed storage, because they group a larger number of keys into each node to minimize the number of seeks required by a read or write operation. (This is why B-trees are often used in file systems and databases, such as SQLite.)

Related questions

When to choose RB tree, B-Tree or AVL tree?

As a programmer when should I consider using a RB tree, B- tree or an AVL tree? What are the key points that needs to be considered before deciding on the choice? Can someone please explain with a scenario for …

Read More
B-Tree vs Hash Table

In MySQL, an index type is a b-tree, and access an element in a b-tree is in logarithmic amortized time O(log(n)). On the other hand, accessing an element in a hash table is in O(1). Why is a …

Read More
Max and min number of keys in a B-tree

What is the maximum and minimum number of keys that can be stored in a B-tree of order 128 and height 3? For the maximum, here's what I did: You have a single root node. The maximum children a root node can …

Read More