Mailing-List: contact user-help@giraph.apache.org; run by ezmlm
Precedence: bulk
Reply-To: user@giraph.apache.org
Received-SPF: pass (nike.apache.org: domain of tki1.50@gmail.com designates
 209.85.215.51 as permitted sender)
MIME-Version: 1.0
In-Reply-To: 
 <CAH361U-1dteH+F33c7irJzB1jCgDPr39nORGZ8XunAohr2C+vg@mail.gmail.com>
References: 
 <CAH361U-1dteH+F33c7irJzB1jCgDPr39nORGZ8XunAohr2C+vg@mail.gmail.com>
Date: Fri, 6 Feb 2015 19:30:03 +0100
Message-ID: 
 <CADDNyjv+6u9GExmzdTCDKY8Juu0vXyCV3wAN6WUbZxwQK2h0sg@mail.gmail.com>
Subject: Re: very important question about partitioning and final combination
From: Flavian Jacquot <tki1.50@gmail.com>
To: user@giraph.apache.org
Content-Type: multipart/alternative; boundary=089e011766d3ebdc40050e6f9b6f

--089e011766d3ebdc40050e6f9b6f
Content-Type: text/plain; charset=UTF-8

Hi, I'm not an expert but I may have answers to your questions.
For 1) A vertex belong to only 1 partition see
https://www.mail-archive.com/user@giraph.apache.org/msg01872.html
For 2) You could use a master computation and an aggregator which count the
number of active vertex, when it drop to 0 you can execute what you want
then call haltComputation() in the master.

Good evening,
Flavian

2015-02-06 16:59 GMT+01:00 Carmen Manzulli <carmenmanzulli@gmail.com>:

> Hi experts,
> i've just two conceptual questions about giraph:
>
> 1) because of giraph works on hadoop, if i have more informations about a
> vertex in different partitions and also in different machines, for example,
> for a social graph or a person graph, about "Alan" (source id) who is (edge
> value) 24 years old (target id) and, on another machine, there is a
> partition with "Alan"(source id) who lives(edge value) in Italy(target id),
> and so on: how giraph will  consider these relations if i ask for all
> people who live in Italy and are 24 years old ?
>
> 2) if giraph doesn't consider relations between same vertex in different
> partitions and machines when it runs compute() methos, is it possible to
> write a  function and make it executable after all iterations by giraph, so
> when all vertices are inactive?
>
> thanks and regards,
> Carmen.
>

--089e011766d3ebdc40050e6f9b6f
Content-Type: text/html; charset=UTF-8
Content-Transfer-Encoding: quoted-printable

<div dir=3D"ltr">Hi, I&#39;m not an expert but I may have answers to your q=
uestions.<div>For 1) A vertex belong to only 1 partition see=C2=A0<a href=
=3D"https://www.mail-archive.com/user@giraph.apache.org/msg01872.html">http=
s://www.mail-archive.com/user@giraph.apache.org/msg01872.html</a></div><div=
>For 2) You could use a master computation and an aggregator which count th=
e number of active vertex, when it drop to 0 you can execute what you want =
then call haltComputation() in the master.</div><div><br></div><div>Good ev=
ening,</div><div>Flavian</div></div><div class=3D"gmail_extra"><br><div cla=
ss=3D"gmail_quote">2015-02-06 16:59 GMT+01:00 Carmen Manzulli <span dir=3D"=
ltr">&lt;<a href=3D"mailto:carmenmanzulli@gmail.com" target=3D"_blank">carm=
enmanzulli@gmail.com</a>&gt;</span>:<br><blockquote class=3D"gmail_quote" s=
tyle=3D"margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div=
 dir=3D"ltr"><div><div><div><div><div>Hi experts,<br></div>i&#39;ve just tw=
o conceptual questions about giraph:<br><br></div>1) because of giraph work=
s on hadoop, if i have more informations about a vertex in different partit=
ions and also in different machines, for example, for a social graph or a p=
erson graph, about &quot;Alan&quot; (source id) who is (edge value) 24 year=
s old (target id) and, on another machine, there is a partition with &quot;=
Alan&quot;(source id) who lives(edge value) in Italy(target id), and so on:=
 how giraph will=C2=A0 consider these relations if i ask for all people who=
 live in Italy and are 24 years old ?<br><br></div>2) if giraph doesn&#39;t=
 consider relations between same vertex in different partitions and machine=
s when it runs compute() methos, is it possible to write a=C2=A0 function a=
nd make it executable after all iterations by giraph, so when all vertices =
are inactive?<br><br></div>thanks and regards,<br></div>Carmen.<br></div>
</blockquote></div><br></div>

--089e011766d3ebdc40050e6f9b6f--