We have the need to store XML in the cache with a Long value as the key.
We can implement this in either of the following 2 ways:
(In the examples the key=123 and XML=
1. Each XML value has 1 node whose FQN is simply new Fqn(new Long(123L)) e.g. /123
2. We only have 1 node and store the data in the standard HashMap key/value way e.g. /ROOT 123,
Which is more efficient particularly as the number of objects in the cache grows?
Does 1 solution have a smaller memory footprint?
Many thanks again for your help,
It's about the same: both children nodes and attributes of a node are stored as hashmaps, so lookup time is the same.