It sounds like you are doing a cross product.. you could use map reduce to
generate the pairs then compute your function on them...
On Jan 18, 2010 3:19 AM, "Xine Jar" wrote:
Thank you for your answer,
The closing of scanner A sounds good it. I'll try it out, but I guess
it will solve the proble
Thank you for your answer,
The closing of scanner A sounds good it. I'll try it out, but I guess
it will solve the problem of the scanner timeout.
On Sun, Jan 17, 2010 at 10:33 PM, stack wrote:
> On Thu, Jan 14, 2010 at 10:08 AM, Xine Jar
> wrote:
>
> > Hallo,
> > my question is more on the arc
On Thu, Jan 14, 2010 at 10:08 AM, Xine Jar wrote:
> Hallo,
> my question is more on the architecture side of my program.
>
> *General view:*
> I have a huge HBase table containing thousands of rows. Each row contains
> an
> ID of a node and its geographical location.
> A single region of the tabl
Hallo,
my question is more on the architecture side of my program.
*General view:*
I have a huge HBase table containing thousands of rows. Each row contains an
ID of a node and its geographical location.
A single region of the table contains approximately 10 000 rows.
*Aim*:
I would like to calcu
