- In Database Management Systems, read:
- Pages 273-289. If you are using another book, this is the introduction to the Section on Storage and Indexing which discusses different access methods and their relative performance.
- Pages 344-358. This is an in-depth discussion of the B+Tree data structure and its implementation. Most database books, as well as any algorithms text (such as CLR or Knuth) will provide an equivalent discussion of B+Trees.
- "The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles." Beckmann et al, in The Red Book. b
- Under what circumstances is a secondary index superior to a sequential (in-order) scan of a heap file? Under what circumstances would the secondary index scan be preferable?
- What is the purpose of the neighbor pointers in a B+Tree? When are they useful?
- Why are B+Trees insufficient for storing and indexing the types of data stored by R*-Trees?
Last change: 2/20/13.
Questions or comments regarding 6.830/6.814? Send e-mail to the 6.830/6.814 staff at 6.830-staff at mit.edu.