1. B-Trees 2. Motivation for B-Trees• So far we have assumed that we can store an entire datastructure in main memory• What if we have so much data that it won’t fit?•…
Slide 1B-Trees 1 Slide 2 2 Motivation for B-Trees Index structures for large datasets cannot be stored in main memory Storing it on disk requires different approach to efficiency…
1.B-Trees2. Motivation for B-Trees So far we have assumed that we can store an entire data structure in main memory What if we have so much data that it won’t fit? We will…