A tree data structure used for indexing data within a database or file system implementation. In a B-tree structure, data is sorted into a set of hierarchical nodes, usually using only three or four levels. The limited number of levels makes effective searches possible, because most of the nodes in the tree do not have to be accessed during a search.