B-trees

A B-tree is a type of data structure used in databases and file systems to efficiently organize and access large amounts of data. It keeps data sorted and allows quick search, insertion, and deletion by maintaining a balanced tree with multiple keys per node. This structure minimizes disk reads because it groups data into blocks, enabling fast lookups even when dealing with vast datasets. Think of it as a highly organized, multi-level index that helps computers locate information swiftly without scanning everything sequentially.