On Fri, Dec 24, 2010 at 4:42 AM, Zhu Han <schumi....@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
