I need to store maybe 250 million String → String entries, and the database seems to be overloaded for this kind of thing.
I can’t keep this in my mind since it will end from the heap. I could expand the heap area, but I would prefer not to.
I want to access one mapping as quickly as possible and would like to know how to do this.
The source string is unique and what I will look for. I also know the range in which the length of the string will be, but its displayed value can be of any length.
Is it possible to get something as fast as a search database? I suppose not, but just wanted to be sure.
I work in Java, but I assume it will be language independent.
source
share