​KembaraXtra-Computer Terms – B-tree (btree):
A B-tree is a structured method used in databases to store and organize indexes efficiently. Each node in the tree contains sorted key values along with links that guide the search process through different ranges of data.
When searching for a record, the system starts at the root node and follows links based on comparisons, moving down the tree until it reaches the desired data. This structure allows fast data retrieval even in very large databases.