Re: row cache hit is costlier for partiton with large rows

The row cache saves partition data off-heap, which means that every cache hit require copying/deserializing the cached partition into the heap, and the more rows per partition you cache, the long it will take. Which is why it's currently not a good cache too much rows per partition (unless you know

row cache hit is costlier for partiton with large rows

Hi, With two different families when I do a read, row cache hit is almost 15x costlier with larger rows (1 rows per partition), in comparison to partition with only 100 rows. Difference in two column families is one is having 100 rows per partition another 1 rows per partition. Schema for