Hi Elias,
That seems to be the ideal solution. If we calculate the intersection of
index keys, there is no need to apply the filters again in the Map Phase.
You can just return the data. Right?
Thanks for sharing your suggestion. I updated the sources to reflect this.
--
Regards,
Sreejith K
large data set (in millions) using filters. But when the MapReduce phase
needs to fetch a large number of items, it is a little slow as supposed to
be ;-). I'll surely share our experience as we go further.
--
Regards,
Sreejith K
On Tue, Feb 28, 2012 at 2:17 AM, Mark Phillips wrote:
7;,
'Vishnu').run(): :
print res
But the inequality filters are based on MIN and MAX values for both *bin*and
*int *indexes (I set that to 99999 for *int* and '' for *bin*).
I'm not sure if that is correct or there is another way to achieve that.
Suggestion
Hi Sean,
Thanks for your reply. I also had this idea of using range queries. The
only catch here is finding the minimum and maximum ranges for the query (if
the property is not "age"). Thanks for sharing your idea using ranges. I
will proceed with this.
--
Regards,
Sreejith K
On W
erties stored using a username as the key).
1. Can I make use of secondary indexes for this kind of inequality queries
so that querying will be faster?
2. If not, what should be the best way to solve this kind of situations in
Riak?
3. Does 2i only work with LevelDB as backend storage?
Thanks in adv
