I have looked at HashTable, trees, etc for my situation but having a hard choosing which one is the best choice. My data might look like this each entry has: Social Security Number <- unique Company Number <- unique Job <- not-unique Age <- not-unique Now I need to be able to search Social Security Number or Company Number get the other three items I will never need to search by Job or Age. What is the best coolection for this. Also, this may or not be important but the serial numbers follow a tree structure. Any help would be welcome. Bill
What about storing all the information in an ArrayList, and then store the arraylist in a hasmap twice. using the SS# and Company # as the keys. OTOH, you can just use two maps.
Bosun
Bosun (SCJP, SCWCD)
So much trouble in the world -- Bob Marley
Bill Norton
Greenhorn
Joined: Mar 29, 2001
Posts: 27
posted
0
Thank for the suggestions. What would be the fastest way? Bill
I agree. Here's the link: http://ej-technologies/jprofiler - if it wasn't for jprofiler, we would need to
run our stuff on 16 servers instead of 3.
0
