A B-Tree splits the index into fixed sized blocks called ___________. What do they correspond to and how large are they?

🎲 Try a Random Question  |  Total Questions in Quiz: 88  |  🧠 Study this quiz with Flashcards
This question is part of a full practice quiz:
Databases Exam Questions — practice the complete quiz, review flashcards, or try a random question.


1. A B-Tree splits the index into fixed sized blocks called ___________. What do they correspond to and how large are they?