Introduction

• As for any index, 3 alternatives for data entries k*:

  • Data record with key value k
  • <k, rid of data record with search key value k>
  • <k, list of rids of data records with search key k>

• Choice is orthogonal to the indexing technique used to locate data entries k*.

• Tree-structured indexing techniques support both range searches and equality searches.

• ISAM: static structure; B+ tree: dynamic, adjusts gracefully under inserts and deletes.

Previous slide

Next slide

Back to first slide

View graphic version