I’m assuming they can, just treating a number by it’s 32 (or 64) bit binary “string”, for example. And in this case, are hash tables (say cache conscious hash tables) still on top of things when it comes to fast insertion/retrieval?
Share
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’m assuming they can, just treating a number by it’s 32 (or 64) bit binary “string”, for example. And in this case, are hash tables (say cache conscious hash tables) still on top of things when it comes to fast insertion/retrieval?
In practice, tries are particularly useful at storing strings because we’re often concerned with the prefix of a string (e.g., auto-completion) and tries excel at prefix searches. It is rare to be concerned with the prefix of integers.