Clarification on 4.x handling of duplicates
Hi,
I know from the architecture paper that prior to BDB5, the duplicates were stored as a separate tree, linked from the BIN. This tree has a DIN, DBIN and LN I suppose.
Here are my questions :
1. Assuming sortedDuplicates is enabled, does this duplicate tree exist always or created only when a key has a duplicate? i.e if only 50% of my keys have duplicates, will all of them still have this tree?
2. How does evict_ln work? Are the DBIN and DIN nodes also cached? or are they treated as LNs since they are lower than the BIN.
Appreciate your help.
Thanks
Vinoth