Previously we have looked at the methods of implementing sparse mappings which conduct searches according to some preplanned scanning strategy. In this chapter we discuss a family of methods where the position of an entry in a directory is related to the value of its key; these methods are known as hashing techniques. Because hashing involves explicitly computing the position of an entry from its key, the technique is only applicable where there is fixed upper bound on the number of directory entries. Hashed directories will therefore be considered as array structures

array [0.. n] of entry

though in essence it is immaterial whether the array is held in main store or on backing store as a randomly accessible file.


Sparse Array Directory Position Symbol Table Function Entry Increment Function 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Derek Coleman 1979

Authors and Affiliations

  • Derek Coleman
    • 1
  1. 1.Department of Computation, Institute of Science TechnologyUniversity of ManchesterManchesterEngland

Personalised recommendations