Database
135 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
Cursor
Database object for traversing result sets row by row
Transaction
Single unit of work that succeeds or fails completely
Graph Database
Database optimized for entity relationship queries
Read Replica
Copy of primary database for read-only queries
CAP Theorem
Theorem on Consistency, Availability, Partition tolerance trade-offs
Cassandra
Distributed NoSQL database with high availability and scalability