Since I wrote that at 3:51AM (my time) I came to many of the same conclusions and decided to write them up to try and provide a high-level guide on sorting and ordering.
* http://jottit.com/s8c4a/ But for completeness I was still hoping to document any workarounds that would help mitigate load balancing issues with the OPP. On Wed, Apr 7, 2010 at 10:46 AM, Benjamin Black <b...@b3k.us> wrote: > I'd suggest you use RandomPartitioner, an index, and multiget. You'll > be able to do range queries and won't have the load imbalance and > performance problems of OPP and native range queries. > > > b > > On Wed, Apr 7, 2010 at 3:51 AM, Paul Prescod <p...@prescod.net> wrote: >> I have one append-oriented workload and I would like to know if >> Cassandra is appropriate for it. >> >> Given: >> >> * 100 nodes >> >> * an OrderPreservingPartitioner >> >> * a replication factor of "3" >> >> * a write-pattern of "always append" >> >> * a strong requirement for range queries >> >> My understanding is that there will exist 3 nodes will end up being >> responsible for all writes and potentially a disproportionate amount >> of reads (in the common case that users care more about recent data >> than older data). >> >> Is there some manual way I can fiddle with InitialTokens and >> ReplicationFactors to share the load more fairly? >> >> Paul Prescod >> >
