Database
29 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
Database
Organized collection of structured data for storage and retrieval
Indexing
Creating data structures to speed up data retrieval
Stored Procedure
Precompiled SQL stored in the database for execution
Graph Database
Database optimized for entity relationship queries
Database Migration
Version-controlled changes to database schema
Denormalization
Intentionally adding redundancy to improve reads