Home
Explore
Exams
Search for anything
Login
Get started
Home
Engineering
Computer Science
Data Structures
B-Tree Algorithm
0.0
(0)
Rate it
View linked note
Learn
Practice Test
Spaced Repetition
Match
Flashcards
Card Sorting
1/3
Earn XP
Description and Tags
Computer Science
Data Structures
B-Tree Algorithm
Add tags
Study Analytics
All
Learn
Practice Test
Matching
Spaced Repetition
Name
Mastery
Learn
Test
Matching
Spaced
No study sessions yet.
4 Terms
View all (4)
Star these 4
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.