4. Record processing using hashing methods

Part of the Lecture Notes in Computer Science book series (LNCS, volume 59)


Searches are intiated in response to a query expressed in relation to the set of all valid records. The hashing methods discussed in this chapter are good for searches that involved a single key, and are called simple queries. These methods work by generating a number, which is influenced by all characters of the key word, and yet, appears to be random with respect to them. This is extremely difficult when dealing with variable word length information, especially with long words, where only one letter differs or where the letters are the same but two have been interchanged.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1978

Personalised recommendations