#Query Evaluation
- Why are repeated insertions into a B+ Tree slow?
- because tree traversal is required on each insert.
- Advantages/Disadvantages of B+ Tree bulk loading
Advantages:
- fast
- allows sequential ordering of memory/disk entries
- allows setting of fill rate (which allows for expansion with minimal splitting)
- allows cleaner concurrency control
Disadvantages:
- You need to implement an efficient sort algorithm and the bulk loading algorithm (which increases complexity of implementation