Database
283 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
DynamoDB
Fully managed serverless NoSQL database by AWS
SQL
Standard language for managing and querying databases
Database Connection
Communication channel between application and database server
Connection Pooling
Managing and reusing database connections
Relational Database
Database storing data in structured tables with relationships
Stored Procedure
Precompiled SQL stored in the database for execution