Could you use a Super CF?

Super Col name is = the Integer, and the Col Names are the UUID. Not sure what your col values= are or your key.
There are some limitations to Super CF b= ut I do not think they would apply in this case http://wiki.apache.org/cassan= dra/CassandraLimitations

You can the slice th= e super col names (your integers) and get back the super col and all = it's columns.

Or you could also u= se a two CF solution...

Index CF where you intege= r is the column name, not sure what your key is. The column value is not i= mportant.
Item CF where the row key is the Integer, = col names are the UUID not sure what the col value is.

=
Some things to consider...
- is there a natural grouping to= your integers ? e.g. every day
- what is the column value ? Wil= l this make for big rows?

Hope that helps. <= /div>
Aaron

On 02 Dec, 2010,at 04:56 AM, = Daniel Lundin <dln@eintr.org> wrote:

Unless I misunderstand the Q, co= mposing the column names with the row
=0Akeys and merging the resulting= would yield something useful.
=0A
=0AkeyA =3D> (1, uuid), (2, uu= id), (3, uid)
=0AkeyB =3D> (1, uuid), (2, uuid), (3, uid)
=0A
= =0AShould be transformed into:
=0A
=0A (1, keyA, uuid),
=0A (1, k= eyB, uuid),
=0A (2, keyA, uuid),
=0A (2, keyB, uuid),
=0A (3, key= A, uuid),
=0A (3, keyB, uuid)
=0A
=0Amap + merge to the rescue.=0A
=0AOn Wed, Dec 1, 2010 at 3:33 PM, Benjamin Waldher <lgbr@lase= rbunny.net> wrote:
=0A> I have a fairly simple problem that might= require a complicated solution.
=0A>
=0A> I need to store Int= eger -> UUID in a column family, and be able to query
=0A> (and t= hen paginate) the rows ordered by the integer in descending order.
=0A&= gt; This is simple enough if no two rows have the same integer, as the int= eger
=0A> could be a column name which can easily be sorted. However= , in my scenario,
=0A> two rows may have the same Integer value. As = such, I would need to use the
=0A> integer as the key in the column = family. However, this means I must use
=0A> OrderPreservingPartition= er, which is going to cause a huge load imbalance on
=0A> one of my = nodes.
=0A>
=0A> How can I have a sorted set of rows of Intege= r -> UUID where the integer may
=0A> exist many times?
=0A>=
=0A
--Apple-Webmail-86--3180664e-e150-657b-e92f-862cdb8cc7c9-- --Apple-Webmail-42--3180664e-e150-657b-e92f-862cdb8cc7c9--