Slideshow:

Review of indexes

The index file is sorted

Can be multi-leveled (to avoid (binary) search) -- example: B⁺-tree

Review of indexes

The index file is accessed using a hash function

Common property of the indexes

Multi-dimenional data

Coordinates of objects are multi-dimensional

Multi-dimenional data

Coordinates of objects are multi-dimensional

Review of the indexes studied so far....

So far, we have studied the following 2 types of index structures:

Ordered (sorted) indexes:
We studied the commonly used representative of sorted index -- the B⁺-tree index:
Hashing-based indexes:

Common property of these indexes:

The search key values are values taken from a one-dimensional space/set

Example:

If we index the search keys that are names, the search key values can be ordered on a one-dimensional space:

Multi-dimensional Information
- There are information that are naturally multi-dimensional
  Examples: