medium10 pts · first answer countsgraphsbalanced-treesdatabases
Why databases index with B-trees
Why do databases such as PostgreSQL and MySQL use B-trees (or B+ trees) for indexes instead of binary search trees?
Discussion 0
Join free to post in the discussion.
Related questions
- Building SQL from user inputBackend Developer
- What atomicity guaranteesBackend Developer
- WHERE column = NULL finds nothingBackend Developer
- COUNT(*) versus COUNT(column)Backend Developer
- Column type for pricesBackend Developer
- Storing order times for two countriesBackend Developer
- Students and courses table designBackend Developer
- What a foreign key doesBackend Developer