cassandra-commits mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Jonathan Ellis (JIRA)" <>
Subject [jira] [Commented] (CASSANDRA-2864) Alternative Row Cache Implementation
Date Sat, 09 Jul 2011 21:39:59 GMT


Jonathan Ellis commented on CASSANDRA-2864:

bq. I was more thinking of replacing the old row cache

That does make more sense than having both, but it's not clear to me that a new container
that has some properties of both memtable and sstable, is better than building something out
of those primitives.

Taking that (2498) approach, you get all the benefits of the sstable infrastructure (persistence,
stat tracking, even streaming to new nodes) for free, as well as playing nicely with the OS's
page cache instead of being a separate memory area.

bq. implementing a variation of CASSANDRA-1956 will be pretty easy since we can work with
the standard filters now

True, but you could do the same kind of IColumnIterator for the existing cache api just as
easily, no?

bq. it seems that they dont help for slicing

Not without extra metadata, no.  But I'm okay with adding that.

> Alternative Row Cache Implementation
> ------------------------------------
>                 Key: CASSANDRA-2864
>                 URL:
>             Project: Cassandra
>          Issue Type: Improvement
>          Components: Core
>    Affects Versions: 0.8.1
>            Reporter: Daniel Doubleday
>            Priority: Minor
>         Attachments: rowcache.patch
> we have been working on an alternative implementation to the existing row cache(s)
> We have 2 main goals:
> - Decrease memory -> get more rows in the cache without suffering a huge performance
> - Reduce gc pressure
> This sounds a lot like we should be using the new serializing cache in 0.8. 
> Unfortunately our workload consists of loads of updates which would invalidate the cache
all the time.
> The second unfortunate thing is that the idea we came up with doesn't fit the new cache
provider api...
> It looks like this:
> Like the serializing cache we basically only cache the serialized byte buffer. we don't
serialize the bloom filter and try to do some other minor compression tricks (var ints etc
not done yet). The main difference is that we don't deserialize but use the normal sstable
iterators and filters as in the regular uncached case.
> So the read path looks like this:
> return filter.collectCollatedColumns(memtable iter, cached row iter)
> The write path is not affected. It does not update the cache
> During flush we merge all memtable updates with the cached rows.
> The attached patch is based on 0.8 branch r1143352
> It does not replace the existing row cache but sits aside it. Theres environment switch
to choose the implementation. This way it is easy to benchmark performance differences.
> -DuseSSTableCache=true enables the alternative cache. It shares its configuration with
the standard row cache. So the cache capacity is shared. 
> We have duplicated a fair amount of code. First we actually refactored the existing sstable
filter / reader but than decided to minimize dependencies. Also this way it is easy to customize
serialization for in memory sstable rows. 
> We have also experimented a little with compression but since this task at this stage
is mainly to kick off discussion we wanted to keep things simple. But there is certainly room
for optimizations.

This message is automatically generated by JIRA.
For more information on JIRA, see:


View raw message