focused on the construction of the row keys from
various data types (numbers, strings, dates) rather than maintaining
the index. It is also possible to merge-join results from multiple
indexes.
--
Bruno Dumon
Outerthought
http://outerthought.org/
On Thu, Feb 11, 2010 at 7:41 PM, Stack wrote:
> On Wed, Feb 10, 2010 at 7:16 AM, Bruno Dumon wrote:
>> Hi,
>>
>> I would like a filter that accepts rows as long as the first X bytes
>> of the row key are less than or equal to a certain byte array.
>>
>
> Wo
, or is there another way to
obtain the same behavior?
Thanks,
Bruno.
--
Bruno Dumon
Outerthought
http://outerthought.org/
t; Integer lid = getLock(lockid, row);
>
> Even if you don't provide a row lock, it will create one for you and
> do the locking stuff. That happens before everything else, so is it
> fair to say that row reads are atomic?
>
> J-D
>
> On Tue, Jan 26, 2010 at 1:42 AM, Brun
correct to say that the writes are
actually atomic per column family within a row?
On a related note, it would be nice if one could do both put and
delete operations on one row in an atomic manner.
Thanks,
Bruno
--
Bruno Dumon
Outerthought
http://outerthought.org/
