It's possible that I am misunderstanding the question in some way.
The row keys can be Time UUIDs and with those row keys as column names, u
can use comparator TIMEUUIDTYPE to have them sorted by time automatically.
On Fri, Jan 14, 2011 at 9:18 AM, Aaron Morton aa...@thelastpickle.comwrote:
@Roshan
Yes, I thought about that, but then I wouldn't be able to use the
Random Partitioner.
@Aaron
Do you mean like this: 'timeUUID+ row_key' as the supercolumn names?
then when retriving the row_key from this column name, will I be
required to parse the name ? How do I do that exactly ?
On Fri, Jan 14, 2011 at 7:15 PM, Aklin_81 asdk...@gmail.com wrote:
@Roshan
Yes, I thought about that, but then I wouldn't be able to use the
Random Partitioner.
Can you please expand a bit on this? What is this restriction? Can you point
me to some relevant documentation on this?
Thanks.
I am not sure but I guess because all the rows of certain time range will go
to just one node will not be evenly distributed because the timeUUID will
not be random but sequential according to time... I am not sure anyways...
On Fri, Jan 14, 2011 at 7:18 PM, Roshan Dawrani
I too believed so! but not totally sure.
On 1/14/11, Rajkumar Gupta rajkumar@gmail.com wrote:
I am not sure but I guess because all the rows of certain time range will go
to just one node will not be evenly distributed because the timeUUID will
not be random but sequential according to
I am not clear what you guys are trying to do and say :-)
So, let's take some specifics...
Say you want to create rows in some column family (say CF_A), and as you
create them, you want to store their row key in column names in some other
column family (say CF_B) - possibly for filtering keys
I just read that cassandra internally creates a md5 hash that is used
for distributing the load by sending it to a node reponsible for the
range within which that md5 hash falls, so even when we create
sequential keys, their MD5 hash is not the same hence they are not
sent to same node. This was
No, you do not need to shut up, please! :)
you may be clearing up my further misconceptions on the topic!
Anyways, the link b/w 1st and 2nd para was that since the rows
distribution among nodes is not affected by key(as you rightly said)
but by md5 hash of the key thus I can use just any key
I would like to keep the reference of other rows as names of super
column and sort those super columns according to time.
Is there any way I could implement that ?
Thanks in advance!
You could make the time an a fixed width integer and prefix your row keys with it, then set the comparotor to ascii or utf.Some issues:- Will you have time collisions ?- Not sure what your are storing in the super columns, but their are
10 matches
Mail list logo
