Posted: 8/28/2006 7:28:15 AM EDT
|
Working on some code that uses a Map to hold DB results. One table has 9 million entries. I'm constructing the hashmap with an initial size of 9 million, but it is still slow. My guess is the slowness is when the .put() method has to search the hash index for a possible duplicate. Are there any other implimentations of Map that are geared towards large numbers of key/value pairs? (at the expense of memory usage is fine, I will trade memory space for speed) |