Re: stop searching

Gustavo Vieira Gonçalves Coelho Rios <[email protected]> writes:

> But if you think that in a linear probe scheme, a table with k slots
> will be completely full by k register,

So you use a larger table.

> This may work if you have fill hundred of register, but if have in the
> order of 10 ^ 8 register, this may be slow. isn't it?

INN uses a hash table with linear probing to implement the history
database, which stores 10^7 entries on a typical server.  It sizes the
table so that it's about 1/3rd empty.  It's not slow.

-- 
Russ Allbery ([email protected])             <http://www.eyrie.org/~eagle/>