Even partitioning of nonuniform ranged data in cassandra?

Why not storing the classifier as a column family row key and the score in column name. Since columns are sorted it is really fast to query the top/bottom 500 columns for a given classifier. The second type of query is also possible, when you are looking for the scores near s you can for instance select 500 columns before s and 500 columns after s and then filter the 500 columns near s.

I thought (perhaps incorrectly) that cassandra had a limit on the number of columns that it could hold. Each classifier right now will have about 2 million scores associated with it. Would 2 million scores, each represented as its own column, still be fast to look up?

– Chris Mar 16 at 22:38 2 From version 0.7 you can store up to 2 billion columns per row. I made some tests and the read performance was good. Well it was good for my needs and with only ~100000 columns.

– Jcs Mar 16 at 23:13 Hmm, I'll have to give that a try! Thank you very much for the insight, much appreciated. – Chris Mar 16 at 23:21 Just an update on this, we've implemented it as you described and the performance is PHENOMENAL compared to our in-memory database implementation.

Thanks SO MUCH. – Chris Mar 160 at 14:44.

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.