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

List:       cassandra-user
Subject:    Re: Encountering timeout exception when running get_key_range
From:       Jonathan Ellis <jbellis () gmail ! com>
Date:       2009-10-21 21:39:26
Message-ID: e06563880910211439j39c764bfj86a079f4977b8205 () mail ! gmail ! com
[Download RAW message or body]

The most straightforward solution is if you can use a timeuuid CF.
Then a batch process can scan starting from [] to get the oldest
entries, which you can then delete.

That said, a memory-based system like redis or something more
specialized like a message queue is may be better if you have a
relatively small amount of data with very high churn.

-Jonathan

On Wed, Oct 21, 2009 at 4:04 PM, Ramzi Rabah <rrabah@playdom.com> wrote:
>> I don't understand what you mean by "gc of entries in the cassandra hash."
>>
>> -Jonathan
>>
>
> Sorry for the ambiguity. What I am trying to provide is something like
> what you find in bigtable ("the client can specify either that only
> the last n versions of a cell be kept, or that only new-enough
> versions be kept (e.g., only keep values that were written in the last
> seven days)."). I know cassandra does not provide time-to-live
> functionality when you insert a record into it, but is there any
> recommendations you might have about this problem?
>
[prev in list] [next in list] [prev in thread] [next in thread]