You can do range queries with the Random Partitioner in 0.6.*, the order of the return is undefined and it's a bit slower.
I think it's normally used when you want ordered range queries in some CF's and random distribution in others.
Is there any strategy for using OPP with a hash algorithm on the client side to get both uniform distribution of data in the cluster *and* the ability to do range queries?
I'm thinking of something like this:
cassKey = (key % 97) + "@" + key;
cassRange = 0 + "@" + range; 1 + "@" + range; ... 96 + "@" + range;
Would something like that work?