6 votes 6 votes Please explain primary and secondary clustering in brief. I tend to forget their difference because their definitions seem quite similar to me. And also, which one is true? According to me it was S1 and S3 but given is S3 only. Algorithms algorithms data-structures hashing + – MiNiPanda asked Jan 21, 2018 • recategorized Jul 6, 2022 by Lakshman Bhaiya MiNiPanda 2.3k views answer comment Share Follow See all 8 Comments See all 8 8 Comments reply Show 5 previous comments MiNiPanda commented Jan 21, 2018 reply Follow Share Double hashing is like h(k,i)=(h1(k) + i*h2(k))modm h1 and h2 are different hash functions which depends on the value of k. If we remove h2 and keep 'i' then it becomes same as linear probing. If h1=h2 then it does not make sense because then also same primary clustering problem would come. h1 and h2 hash functions will produce different results for a given 'k'. Here the multiplication of h2 will ensure much less probability of two elements getting collided. Is this okay? 3 votes 3 votes junk_mayavi commented Jan 21, 2018 reply Follow Share cool :D 1 votes 1 votes santosh1999 commented Sep 26, 2019 reply Follow Share no the linear probing suffers from both primary and there is a chance of suffering from secondary clustering 2 votes 2 votes Please log in or register to add a comment.
