Is a hash table a good data structure for storing data in an application that support partial search such as "select * from MyTable where name like 'John%'. If not, what is?
I would have thought that hash table isnt ideal because there no way to make faster than O(n). Maybe a some kind of balanced binary tree best. However, I am not sure that it would be best for the particular query above.