incubator-cassandra-user mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Jonathan Ellis <jbel...@gmail.com>
Subject Re: CF that is like a non-clustered index, are key lookups that fast?
Date Tue, 15 Jun 2010 15:07:21 GMT
In a read-mostly workload it will be better to denormalize the post
contents into subcolumns of the top_posts rows.

On Tue, Jun 15, 2010 at 2:29 AM, S Ahmed <sahmed1020@gmail.com> wrote:
> If you store only the key mappings in a column family, for custom ordering
> of rows etc. for things like:
> friends = {
>
>    user_id : { friendid1, friendid2, ....}
> }
> or
> topForumPosts = {
>
>     forum_id1 : { post2343, post32343, post32223, ...}
> }
>
> Now on friends page or on the top_forum_posts page you will get back a list
> of post_ids, you will then have to perform lookups on the main 'posts' CF to
> get the actual data.  So if a page is displaying 10, 25, or 50 posts you
> will have 10, 25 or 50 key based lookups for each page view.
> Is this the suggested way?  i.e. a look based on a slice to get a list of
> post_id's, then a seperate call to actually fetch the data for the given
> entity.
> Or is cassandra so fast that 50 key based calls is no reason to worry?
>
>
>



-- 
Jonathan Ellis
Project Chair, Apache Cassandra
co-founder of Riptano, the source for professional Cassandra support
http://riptano.com

Mime
View raw message