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.
is sharding based on firstchar of user’s name an example of consistent hashing?
To be sure, if i shard my database depending on the char-length of the user’s name, is it Consistent hashing in the sense that addition or removal of one slot does not change the mapping of keys to slots?
(I know it is definitely not the most efficient way to shard data, but what i’m interested in is by the definition of consistent hashing, is that way of sharding considered consistent?)
it’s consistent but it is not much of a hash
run a test sharding on actual data (using group by and count) and you will see how effective it is
my guess would be that it would be very uneven