Most efficient way to determine if 1000 specific keys exist?

Alexander Sicular siculars at
Wed May 9 13:35:12 EDT 2012

Or just do an exists set operation in redis.

Or use a bloom filter. (that you kept in Riak)

Or use your own binary encoding n keys long and flip bits. (that you kept
in Riak)

Scanning a list of keys in Riak might be one of the most inefficient ways
to do it. Also I don't like to keep values in Riak that mutate in some
unbounded way due to compaction issues.



Sent from my rotary phone.
On May 9, 2012 1:13 PM, "Shuhao Wu" <admin at> wrote:

> Without reading all the emails.. why can't you just cache the keys in an
> object and maintain that list? The you could check against that list. This
> way you don't have to go through every object in riak.
> Shuhao
> On May 2, 2012 2:47 PM, "Tim Haines" <tmhaines at> wrote:
>> Hey guys,
>> Still a relative newbie here.
>> I was hoping to be able to setup a MapReduce job that I could feed 1000
>> keys to, and have it tell me of the 1000, which keys exist in the bucket.
>>  I was hoping this could use the key index (such a thing exists right?)
>> without having to read the objects.
>> The methods I've tried for doing this fail when the first non-existing
>> key is found though.
>> Is there a way to do this?
>> Or alternatively, is there a way to check for the presence of one key at
>> a time without riak having to read the object?
>> Cheers,
>> Tim.
>> _______________________________________________
>> riak-users mailing list
>> riak-users at
> _______________________________________________
> riak-users mailing list
> riak-users at
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <>

More information about the riak-users mailing list