2D Maps and getSearchBothRange

Question

I need to store several 2d maps, i.e. data of the form:
[key1][key2] -> value
After talking with an expert it's been suggested I try the following schema:
setSortedDuplicates(true)
[key1] -> [key2] + value
And use getSearchBothRange(key = [key1], data = [key2]) to find the value.
As opposed to the more traditional [key1] + [key2] -> value, which results in significant key duplication. Fair enough. This makes a lot of sense in my application scenario, and I can easily test my performance vs. the traditional method.
However, I'm using Java and would like to be able to store Serializable values. Unfortunately, there doesn't seem to be any way to reconcile the TupleBinding and SerialBinding interfaces such that I can create a DatabaseEntry of the form:
tupleOutput.readString([key2])
tupleOutput.readSerializable(value) //This method does not exist.
Any suggestions as to how I can pack a String, followed by a Serializable, into a DatabaseEntry without giving up the benefits of the SerialBinding's class catalog?
Thanks,
dwm
Edited by: 886451 on Sep 20, 2011 3:37 PM

Answer 1

Well I know that some is stored but since I do not have a clue how caching works on the ipod I do not know f I can rely on this. Does maps have its own fixed cache size? Is it shared with other applications?
I note that there are applications out there which claim to store maps for you but if one can rely on the cache then such applications might not be necessary.