Re: implementation choice with regard to multiple range slice query filters

2012-04-03 Thread David Alves
cool, thanks. -david On Apr 4, 2012, at 1:01 AM, Jonathan Ellis wrote: > You need more than column_index_size_in_kb worth of column data for it > to generate row header index entries. We have a cassandra.yaml in > test/conf that sets that extra low, to 4, to make that easier. "ant > test" sets

Re: implementation choice with regard to multiple range slice query filters

2012-04-03 Thread Jonathan Ellis
You need more than column_index_size_in_kb worth of column data for it to generate row header index entries. We have a cassandra.yaml in test/conf that sets that extra low, to 4, to make that easier. "ant test" sets up the environment to point to that yaml, but if you're running it from your IDE

Re: implementation choice with regard to multiple range slice query filters

2012-04-03 Thread David Alves
Hi Jonathan: Thanks for the tip. Although the first option I proposed would not incur in that penalty it would not take advantage of the columns index for the middle ranges. On a related matter, I'm struggling to test the IndexedBlockFetcher implementation (SimpleBlockF

Re: implementation choice with regard to multiple range slice query filters

2012-04-02 Thread Jonathan Ellis
That would work, but I think the best approach would actually push multiple ranges down into ISR itself, otherwise you could waste a lot of time reading the row header redundantly (the skipBloomFilter/deserializeIndex part). The tricky part would be getting IndexedBlockFetcher to not do extra work

implementation choice with regard to multiple range slice query filters

2012-04-02 Thread David Alves
Hi guys I'm a PhD student and I'm trying to dip my feet in the water wrt to cassandra development, as I'm a long time fan. I'm implementing CASSANDRA-3885 which pertains to supporting returning multiple slices of a row. After looking around at the portion of the