I need a suggestion from you guys regarding an implementation.
I havea requirement of maintaining data as Key-Value pair.On searching, I found that it can be done with the help of either hashing or through binary Search tree.
What I have found is that hashing use index based searching which is must faster than tree traversing.
Could any one suggest me which will be better?
Records count can be great number.
Thanks in Advance.