What Is B-tree Index?

1.	What Is B-tree Index?
Answer» A B-Tree INDEX is a DATA structure in the FORM of a tree, but it is a tree of database blocks, not rows. A B-Tree index is a data structure in the form of a tree, but it is a tree of database blocks, not rows.

Answer»

A B-Tree INDEX is a DATA structure in the FORM of a tree, but it is a tree of database blocks, not rows.

A B-Tree index is a data structure in the form of a tree, but it is a tree of database blocks, not rows.

Discussion