Aaron, thank you for the link.
What is discussed there is not exactly what I am thinking of. They propose
distributing the keys with . - which will distribute
the values in a way that cannot easily be reversed. What I am proposing is
to distribute the keys evenly among N buckets, where N is much l
That pattern is discussed here http://ria101.wordpress.com/2010/02/22/cassandra-randompartitioner-vs-orderpreservingpartitioner/It's also used in http://github.com/tjake/LucandraYou can do range queries with the Random Partitioner in 0.6.*, the order of the return is undefined and it's a bit slower
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
