btree is the short for “binary tree”. The use of the binary trees for data retrieving dates back the end of the 50’s and, in its different ways of implementation, is still now the most widespread indexing solution; it’s largely used not only by the most modern search engines, but also by the most famous Databases on the market.
It is the synonym of efficiency and effectiveness, but it also means stability and duration, because in a technological area always in fast transformation, the “btree” has developed without ever being outdated, always updating in terms of power, speed and reliability.