B-Tree Algorithm

0.0(0)
studied byStudied by 0 people
linked notesView linked note
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/3

flashcard set

Earn XP

Description and Tags

Computer Science

Data Structures

B-Tree Algorithm

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

4 Terms

1
New cards
B Trees
________ can be easily optimized to adjust its size (that is the number of child nodes) according to the disk size.
2
New cards
Multi level index
________ can be designed by using B Tree for keeping the data sorted in a self- balancing fashion.Search Operation.
3
New cards
search operation
The ________ is the simplest operation on B Tree.
4
New cards
delete operation
The ________ has more rules than insert and search operations.