Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I need to make a program that shows the hash value of a given key, using extendible hashing.
In extendible hashing, I know that the buckets split and directories change. So if I make my program, do I have to already know things like if the bucket it hashes to is filled, or do I not have to worry about those things and just compute a hash value based on the key?
In an extendable hashing scheme, you can calculate a hash value based soley on the key. However, when operating on the table, you only use the top N bits of the key, where N grows with the number of buckets.
So you do need to worry about the current bucket statistics if you want to implement an extendable hash, but not to simply calculate a hash value.