Hashing in Computer Science by Konheim Alan G

Author:Konheim, Alan G.
Language: eng
Format: epub
Publisher: John Wiley & Sons, Inc.
Published: 2010-11-24T16:00:00+00:00

13.8 A POSSIBLE IMPROVEMENT TO LINEAR PROBING

We study an environment in which a hash table remains relatively static, meaning infrequent insertions occur after the initial LP insertion of m keys (k0, k1, … , km−1) into an n-cell hash table. The examples we have in mind include the following:

An airline reservation system, keys derived from the flight numbers

The student records at a university, keys derived from student IDs.

In both instances, there will be additional entries; however, keep in mind the following:

New airline flights might be introduced infrequently compared with the time scale at which SEARCH is carried out.

New student records might only be created infrequently; for example, only once a quarter or semester.

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.