B-trees are a type of self-balancing tree data structure that maintain sorted data and allow for efficient insertion, deletion, and search operations. They are particularly advantageous for databases because they minimize disk I/O operations, making them faster than simpler structures like binary search trees, especially for large datasets.