incubator-cassandra-user mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Kevin Irwig <kevinir...@yahoo.com>
Subject Re: complexity
Date Sat, 25 Dec 2010 04:35:05 GMT
thanks all - and just to clarify the cost of getting a column (and a column 
given a SuperColumn) is also O(log N) ?




________________________________
From: Zhu Han <schumi.han@gmail.com>
To: user@cassandra.apache.org
Sent: Sat, 25 December, 2010 3:16:08 AM
Subject: Re: complexity

Yep. I forgot about the binary search part.

Thank you!

regards,
hanzhu



On Fri, Dec 24, 2010 at 9:35 PM, Jonathan Ellis <jbellis@gmail.com> wrote:

On Fri, Dec 24, 2010 at 4:42 AM, Zhu Han <schumi.han@gmail.com> wrote:
>
>> When the row is stored on disk as SSTable, the complexity of getting a row
>> is constant, as it always know where to get the row by in-memory indices.
>
>Technically, it's O(log N) because of the binary search on the in-memory index.
>
>--
>Jonathan Ellis
>Project Chair, Apache Cassandra
>co-founder of Riptano, the source for professional Cassandra support
>http://riptano.com
>



      
Mime
View raw message