Hi,
I've tried searching for this all over the place, but I can't find an
answer anywhere...
What is the (theoretical) time complexity of basic C* operations?
I assume that single lookups are O(log(R/N)) for R rows across N nodes
(as SST lookups should be O(log(n)) and there are R/
On Fri, Dec 24, 2010 at 10:35 PM, Kevin Irwig wrote:
> thanks all - and just to clarify the cost of getting a column (and a column
> given a SuperColumn) is also O(log N) ?
>
Since subcolumns are not indexed (
https://issues.apache.org/jira/browse/CASSANDRA-598) retrieving them from a
SuperColu
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
To: user@cassandra.apache.org
Sent: Sat, 25 December, 2010 3:16:08 AM
Subject: Re: complexity
Yep. I forgot about the binary
Yep. I forgot about the binary search part.
Thank you!
regards,
hanzhu
On Fri, Dec 24, 2010 at 9:35 PM, Jonathan Ellis wrote:
> On Fri, Dec 24, 2010 at 4:42 AM, Zhu Han wrote:
> > When the row is stored on disk as SSTable, the complexity of getting a
> row
> > is constant,
On Fri, Dec 24, 2010 at 4:42 AM, Zhu Han 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.
-
>> 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.
>
> BTW: not the whole indices are kept in memory, just part of them are. This
> is controlled by "IndexInterval"
On Fri, Dec 24, 2010 at 6:42 PM, Zhu Han 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.
>
BTW: not the whole indices are kept in memory, just part of them are. This
is cont
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.
When the row is stored in memory as memtable, it is stored as skip list[1].
The complexity is O(logN). N is the total number of rows in the skip
Hi,
I've seen a similar question has been asked in this forum in Sept, but not
answered.
What is the complexity of get(row) and get(row, column-name) operations, and
insert(row, column)? What about accessing or inserting a column within a
SuperColumn by name?
In Arin Sarkissian's
Hello list,
sorry, i forgot a verb... what i meant is "the complexity of the lookup
of a row or a row+columns".
so: get(key) and get(key, column).
Thanks
--
Claudio Martella
Digital Technologies
Unit Research & Development - Analyst
TIS innovation park
Via Siemens 19 |
Hello list,
what is the complexity of specific row and specific row/column with
sstable files? Is it O(1)? i'm considering the idea of putting a graph
in cassandra's datamodel and i'd like to follow n-length paths in n*O(1).
the idea is to create a column family where i stor
11 matches
Mail list logo
