For Databases Is a B-Tree the Same as an Index?

In the context of databases, Is a B-tree the same as an index?

For many intents and purposes they are the same.

"B-Tree is a self-balancing search tree." Taken from

"B-tree is a data structure that store data in its node in sorted order."

This source says that the "B" stands for "balanced" (not "binary"):

To learn more see this:

Leave a comment

Your email address will not be published. Required fields are marked *