Database
27 views
B-Tree Index
Quick Definition
Self-balancing tree index for efficient sorted data operations
Full Definition
A self-balancing tree data structure that maintains sorted data allowing logarithmic time search insert and delete operations.
Examples
primary key indexing, range queries, database performance
Related Terms
indexing
query-optimization
relational-database
More Database Terms
CAP Theorem
Theorem on Consistency, Availability, Partition tolerance trade-offs
Concurrency Control
Managing simultaneous data access while maintaining consistency
Data Modeling
Creating a model describing data structure and relationships
Indexing
Creating data structures to speed up data retrieval
NoSQL
Non-relational databases with flexible data models and scaling
Read Replica
Copy of primary database for read-only queries