[prev in list] [next in list] [prev in thread] [next in thread] 

List:       cassandra-user
Subject:    Re: cassandra vs hbase summary (was facebook messaging)
From:       David Jeske <davidj () gmail ! com>
Date:       2010-11-27 18:32:00
Message-ID: AANLkTinDdUb-u+XW93h_P-7BwBMiWxLjLRPBOUM0NDCp () mail ! gmail ! com
[Download RAW message or body]

Thanks for all the great answers last week about Cassandra. I have an
additional question about cassandra and columns/supercolumns. I had naively
assumed that columns and super-columns map to an internal row-key (like how
in Bigtable the indexed map is row/column-key/timestamp to data), but some
performance information I've found hints otherwise. (things got slow with
large numbers of columns)

How are columns and super-columns handled? Specifically, are operations on
specific columns within a row closer to O(num-columns) or closer to log-n
(i.e. individual row-performance)?

[Attachment #3 (text/html)]

Thanks for all the great answers last week about Cassandra. I have an addit=
ional question about cassandra and columns/supercolumns.=A0I had naively as=
sumed that columns and super-columns map to an internal row-key (like how i=
n Bigtable the indexed map is row/column-key/timestamp to data), but some p=
erformance information I&#39;ve found hints otherwise. (things got slow wit=
h large numbers of columns)<div>
<div><br></div><div>How are columns and super-columns handled?=A0Specifical=
ly, are operations on specific columns within a row closer to O(num-columns=
) or closer to log-n (i.e. individual row-performance)?=A0</div><div><br></=
div>
<div><br></div><div><br></div><div><br></div></div>


[prev in list] [next in list] [prev in thread] [next in thread]