A lookup table that is designed to efficiently store non-contiguous keys (account numbers, part numbers, etc.) that may have wide gaps in their alphabetic or numeric sequences. THIS DEFINITION IS ...

it is possible to construct a hash table using Krapivin's method that achieves far better probe complexity – the average number of locations that need to be checked (probed) to find a value to a ...