That’s not what I mean. When some data is changed in a some vertices, their event is pushed to the event queue, and thus the correct transformer is called. We update the data of the current vertex, and for each neighbor that we created in the transformer, we check the following: if the neighbor vertex doesn't exist yet or if the id_deleted property of the neighbor vertex is false, then update the vertex in the graph. Then it checks if the edge is not in the graph yet, then it adds it.
Alexey From: Yujun Zhang [mailto:zhangyujun+...@gmail.com] Sent: Sunday, January 08, 2017 5:45 PM To: OpenStack Development Mailing List (not for usage questions) Subject: [ALU] Re: [openstack-dev] [ALU] Re: [ALU] Re: [ALU] Re: [ALU] [vitrage]how touseplaceholder vertex Hi, Alexey On Sun, Jan 8, 2017 at 2:50 PM Weyl, Alexey (Nokia - IL) <alexey.w...@nokia.com> wrote: Hi Yujun, A relationship is defined by the following trio: source id, target id and a label on the edge. In the processor, I add only edges that doesn't exists. Currently the vertex is mapping to entity, and the edge is mapping to relationship. So do you mean that we should update the label if the relationship between two entities changes? e.g. we change the link between two PC's from cable to Wi-Fi. __________________________________________________________________________ OpenStack Development Mailing List (not for usage questions) Unsubscribe: openstack-dev-requ...@lists.openstack.org?subject:unsubscribe http://lists.openstack.org/cgi-bin/mailman/listinfo/openstack-dev
