Database
282 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
SQL
Standard language for managing and querying databases
ORM
Mapping object-oriented code to database tables
Time-Series Database
Database optimized for time-stamped data storage
Database Migration
Version-controlled changes to database schema
NoSQL
Non-relational databases with flexible data models and scaling