Performance

• Insert cost: 1

• Average search cost (hit): 1+N/(2 M)

• Average search cost (miss): 1+N/M

• Worst case search cost: N+1

• Expected worst case search cost (n=m):

~log n/log log n

• Space requirements:

  • (N + M) * |link| + N*|key| + N*|info|

• Deletions: easy

• Adaptation (new hash function): easy

Previous slide

Next slide

Back to first slide

View graphic version