My best advice on this is, insert a bit of data into the tree, and then do a
heap dump to calculate the extra overhead. It's unfortunately more than you
would like from our testing.
On Tue, Oct 18, 2011 at 8:14 PM, Todd Nine wrote:
> **
> Hi guys,
> We've just built a K tree implementation in
Hi guys,
We've just built a K tree implementation in cassandra. We're going
for relatively "wide" nodes in our tree to minimize our tree depth and
increase our search times. Most of the links between parent/child
nodes are longs. We're ready to start tuning the size of K so that our
most acce
