63:
331:
22:
165:
246:, the mapping of two or more keys to consecutive slots. Such clustering may cause the lookup cost to skyrocket, even if the load factor is low and
368:
283:
223:
205:
146:
49:
300:
80:
35:
127:
84:
99:
392:
106:
183:
73:
361:
113:
387:
250:
are infrequent. The popular multiplicative hash is claimed to have particularly poor clustering behaviour.
95:
175:
354:
187:
41:
279:
338:
120:
304:
247:
381:
237:
267:
62:
242:
330:
158:
56:
15:
342:
87:. Unsourced material may be challenged and removed.
278:(2nd ed.). Addison-Wesley. pp. 513–558.
362:
8:
186:. There might be a discussion about this on
50:Learn how and when to remove these messages
369:
355:
224:Learn how and when to remove this message
206:Learn how and when to remove this message
147:Learn how and when to remove this message
337:This cryptography-related article is a
259:
7:
327:
325:
85:adding citations to reliable sources
341:. You can help Knowledge (XXG) by
14:
31:This article has multiple issues.
329:
163:
61:
20:
272:The Art of Computer Programming
72:needs additional citations for
39:or discuss these issues on the
1:
299:Wang, Thomas (March 1997).
409:
324:
301:"Prime Double Hash Table"
276:Sorting and Searching
176:confusing or unclear
81:improve this article
184:clarify the article
393:Cryptography stubs
350:
349:
285:978-0-201-89685-5
234:
233:
226:
216:
215:
208:
157:
156:
149:
131:
54:
400:
371:
364:
357:
333:
326:
316:
315:
313:
312:
303:. Archived from
296:
290:
289:
264:
229:
222:
211:
204:
200:
197:
191:
167:
166:
159:
152:
145:
141:
138:
132:
130:
96:"Key clustering"
89:
65:
57:
46:
24:
23:
16:
408:
407:
403:
402:
401:
399:
398:
397:
378:
377:
376:
375:
322:
320:
319:
310:
308:
298:
297:
293:
286:
274:. Vol. 3:
266:
265:
261:
256:
230:
219:
218:
217:
212:
201:
195:
192:
181:
168:
164:
153:
142:
136:
133:
90:
88:
78:
66:
25:
21:
12:
11:
5:
406:
404:
396:
395:
390:
388:Key management
380:
379:
374:
373:
366:
359:
351:
348:
347:
334:
318:
317:
291:
284:
258:
257:
255:
252:
232:
231:
214:
213:
171:
169:
162:
155:
154:
69:
67:
60:
55:
29:
28:
26:
19:
13:
10:
9:
6:
4:
3:
2:
405:
394:
391:
389:
386:
385:
383:
372:
367:
365:
360:
358:
353:
352:
346:
344:
340:
335:
332:
328:
323:
307:on 1999-09-03
306:
302:
295:
292:
287:
281:
277:
273:
269:
268:Knuth, Donald
263:
260:
253:
251:
249:
245:
244:
240:should avoid
239:
238:hash function
228:
225:
210:
207:
199:
189:
188:the talk page
185:
179:
177:
172:This article
170:
161:
160:
151:
148:
140:
137:November 2019
129:
126:
122:
119:
115:
112:
108:
105:
101:
98: –
97:
93:
92:Find sources:
86:
82:
76:
75:
70:This article
68:
64:
59:
58:
53:
51:
44:
43:
38:
37:
32:
27:
18:
17:
343:expanding it
336:
321:
309:. Retrieved
305:the original
294:
275:
271:
262:
241:
235:
220:
202:
193:
182:Please help
173:
143:
134:
124:
117:
110:
103:
91:
79:Please help
74:verification
71:
47:
40:
34:
33:Please help
30:
382:Categories
311:2015-05-10
254:References
248:collisions
243:clustering
178:to readers
107:newspapers
36:improve it
196:June 2020
42:talk page
270:(1998).
236:Key or
174:may be
121:scholar
282:
123:
116:
109:
102:
94:
128:JSTOR
114:books
339:stub
280:ISBN
100:news
83:by
384::
45:.
370:e
363:t
356:v
345:.
314:.
288:.
227:)
221:(
209:)
203:(
198:)
194:(
190:.
180:.
150:)
144:(
139:)
135:(
125:·
118:·
111:·
104:·
77:.
52:)
48:(
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
