Database
136 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
Time-Series Database
Database optimized for time-stamped data storage
Denormalization
Intentionally adding redundancy to improve reads
View
Virtual table defined by a SQL query
Partitioning
Dividing tables into smaller pieces for better performance
Write Ahead Log
Persistence mechanism writing changes to log before database
DynamoDB
Fully managed serverless NoSQL database by AWS