Thanks Kiran for posting our off line conversations here.
During a discussion with Alex it was understood that implementing a
splay tree for duplicate key cursor may not result in any
When we perform lookups on the splay tree (kept in memory after
serialized version ) its structure changes due to splaying.
This changed structure will be discarded without writing back to the
eliminate the write cost. This way it will not help us in any form
to get the amortized
So we are thinking of using some kind of btree for the actual
- Kiran Ayyagari