Large data structure optimisation
I have a data structure:
List<Map><Comparable, Map><Comparable, short[]>>>
Which is weighing in at around 2 gigs or so, the keyset at both levels of map is around 4000 entries. The comparable's are generally Strings with length of about 10. I'm looking for ideas for reducing the memory usage of the structure, with creation performance being relevant but not critical.
Message was edited by:
MarkW5
Sorry about the formatting of the generics I couldn't make it work better.
[539 byte] By [
MarkW5a] at [2007-11-27 2:29:17]

> I have a data structure:
>
> List<Map><Comparable, Map><Comparable, short[]>>>
>
> Which is weighing in at around 2 gigs or so, the
> keyset at both levels of map is around 4000 entries.
> The comparable's are generally Strings with length of
> about 10. I'm looking for ideas for reducing the
> memory usage of the structure, with creation
> performance being relevant but not critical.
>
> Message was edited by:
> MarkW5
> out the formatting of the generics I couldn't make it
> work better.
it's better to use a database (i think)