Page 113 - Data Structures Handout_Neat
P. 113
9.6.1 Database Indexing
Databases use hashing to quickly locate records. Instead of scanning through all
entries, a hash function maps a key (like a student ID or employee number) directly to the
location of the record.
Example: Simple Database Indexing in C++
This example shows how hashing can be used to store and retrieve records efficiently
in a database-like system.
113
