But it will need to build BloomFilters for each vertex for each edge so idk
how efficient that would be.
On Mon, Jul 20, 2015 at 4:02 PM, Shivani Ghatge wrote:
> Hello Vasia,
>
> I will adapt the exact method for BloomFilter. (I think it can be done.
> Sorry. My mistake).
>
>
Hello Vasia,
I will adapt the exact method for BloomFilter. (I think it can be done.
Sorry. My mistake).
On Mon, Jul 20, 2015 at 3:45 PM, Shivani Ghatge wrote:
> Also the example of Jaccard that you had linked me to used VertexCentric
> configuration which I understand is because th
at 3:43 PM, Shivani Ghatge wrote:
> Hello Vasia,
>
> As I had mentioned before, I need a BloomFilter as well as a HashSet for
> the approximation to work. In the exact solution I am getting two HashSets
> and comparing them. In approximate version, if we get two BloomFilters then
&
n through the
>> ExuectionEnvironment. Can you try that?
>>
>> Cheers,
>> Max
>>
>> On Mon, Jul 20, 2015 at 2:23 PM, Shivani Ghatge
>> wrote:
>>
>>> Hello Maximilian,
>>>
>>> Thanks for the suggestion. I will use it to ch
d JAR to the local cluster using the command-line tool (./bin/flink).
>
> Hope that helps.
>
> Cheers,
> Max
>
> On Mon, Jul 20, 2015 at 2:04 PM, Shivani Ghatge
> wrote:
>
>> Hello,
>> I am working on a problem which implements Adamic Adar Algorithm using
&g
Hello,
I am working on a problem which implements Adamic Adar Algorithm using
Gelly.
I am running into this exception for all the Joins (including the one that
are part of the reduceOnNeighbors function)
Too few memory segments provided. Hash Join needs at least 33 memory
segments.
The problem
