This link has been bookmarked by 18 people . It was first bookmarked on 13 Jul 2006, by ryan.
-
05 Mar 09
-
06 Feb 09
-
09 Nov 08
-
he primary operation it supports efficiently is a lookup: given a key (e.g. a person's name), find the corresponding value (e.g. that person's telephone number). It works by transforming the key using a hash function into a hash, a number that is used as an index in an array to locate the desired location ("bucket") where the values should be.
-
-
24 Oct 08
-
The primary operation it supports efficiently is a lookup:
-
-
09 Jun 08
-
19 Mar 08
-
-
- 7 more annotations...
-
-
Evaluating a good hash function can be a slow operation. In particular, if simple array indexing can be used instead, this is usually faster.
-
Hash tables in general exhibit poor locality of reference
-
Compared to other associative array data structures, hash tables are most useful when large numbers of records are to be stored, especially if the size of the data set can be predicted.
-
a black hat with knowledge of the hash function may be able to supply information to a hash which creates worst-case behavior by causing excessive collisions, resulting in very poor performance (i.e., a denial of service attack)
-
With a good hash function, a hash table can typically contain about 70%–80% as many elements as it does table slots and still perform well.
-
1 + 2 + 4 + 8 + ... + n = 2n - 1.
-
-
-
16 Dec 07
-
10 May 07
-
27 Mar 07
-
04 Dec 06
-
10 Jul 06
Would you like to comment?
Join Diigo for a free account, or sign in if you are already a member.