Geek Answers Handbook

What data structure is used in most popular databases?

I want to know what data structure (AVL, B-Tree, etc.) is used in most popular relational databases. and how does the data structure outperform other data structures in the class? if possible a little comparison can help me! thanks in advance!

+6
language-agnostic data-structures relational-database
source share
3 answers

Usually a B-tree or its variants, primarily because it packs nodes into blocks, unlike binary trees such as AVL.

A node of a B-tree has a fixed maximum size and contains several keys and several pointers to child nodes, that is, fewer blocks must be removed from the disk to find the value (compared to the binary tree).

The Wikipedia article on B + trees has a good introduction in terms of its application to databases.

+8
source share

For SQL Server, there is reference information here .

+3
source share

I would choose the B + Selection Tree because it is suitable for efficient insert, delete and range queries, but if the database has not been modified since it was created, then a SIMPLE LINEAR INDEX is required

+1
source share

More articles:


All Articles