Alternatives for Data Entry k* in Index
- 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 of alternative for data entries is orthogonal to the indexing technique used to locate data entries with a given key value k.
- Examples of indexing techniques: B+ trees, hash-based structures
- Typically, index contains auxiliary information that directs searches to the desired data entries