# Overview A [[database index]] which uses the [[B-Trees]] data structure to store, read, and write data. It is the most common [[database index]], especially in [[Relational Databases]]. ## Diagram ![[B-Trees 2024-09-09 14.34.15.excalidraw.svg]] # Key Considerations # Pros of B-Tree Index #flashcard - Faster on reads, compared to [[Log Structured Merge (LSM) Trees Index]] - Great for databases that want strong transaction semantics, since each key exists in exactly one place - Better support for range queries compared to [[hash index]]es <!--ID: 1751507776904--> # Cons of B-Tree Index - Slower on writes, compared to [[Log Structured Merge (LSM) Trees Index]] - Higher storage overhead compared to [[Log Structured Merge (LSM) Trees Index]] # Use Cases # Related Topics