The Period of Search for the Quadratic and Related Hash Methods | Zendy

Alexander S. Ecker | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

The Period of Search for the Quadratic and Related Hash Methods

Author(s) -

Alexander S. Ecker

Publication year - 1974

Publication title -

the computer journal

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.319

H-Index - 64

eISSN - 1460-2067

pISSN - 0010-4620

DOI - 10.1093/comjnl/17.4.340

Subject(s) - period (music) , quadratic equation , hash function , computer science , hash table , mathematics , table (database) , data mining , computer security , physics , acoustics , geometry

Accessing or entering a key s into a hash table of length m means the computing of a mapping function A:S -* Zm from a set of keys S to the integers modulo m. If the position (hash address) h(s) (s e S) is empty (in case of entering a new key) or contains the key s (in case of searching for key s) the table search is concluded. Otherwise additional positions in the table must be tried until either a satisfactory entry is found or the table is found to be full (no empty positions can be found). We have to create a sequence of hash addresses

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research