On Mon, Jul 21, 2014 at 10:54 AM, Marcelo Elias Del Valle < marc...@s1mbi0se.com.br> wrote:
> My understanding (please some correct me if I am wrong) is that when you > insert N items in a Cassandra CF, you are executing N binary searches to > insert the item already indexed by a key. When you read the data, it's > already sorted. So you take O(N * log(N)) (binary search complexity to > insert all data already sorted. > You're wrong, unless you're talking about insertion into a memtable, which you probably aren't and which probably doesn't actually work that way enough to be meaningful. On disk, Cassandra has immutable datafiles, from which row fragments are merged into a row at read time. I'm pretty sure the rest of the stuff you said doesn't make any sense in light of this? =Rob
