1. Hashing with Buckets

8. read

10. 1

11. 6+4 = 10

13. 2

15. Cluster 1: Adams  Coles  Flint Cluster 2: Bates  Dean

16. The problem is that the home address of dean, which is the head of a cluster, is not free (20)Adams  (20)Coles  (22)Dean  (20)Flint Two clusters Overlapped

17. 25 22 23

19. 3

20. b >=1, may be more than one slot in bucket

21. 4 Actual Addresses. See next slide Applicable to variable length records

23. Patterns of records access

24. Summary : Hashing technique Progressive overflow Other techniques 1.Double hashing 2.Chained progressive overflow 3.Chaining with a separate overflow area 4.Scatter tables Buckets