B-Tree is self balancing binary search tree. B-Tree is mainly used for database indexes. Disk access is low compared to Red-black and AVL trees.
B-Tree is optimized to read big files and is used in databases and file systems. Here is detailed description of implementation details. Another nice explanation of B-Tree.