Ok, so, exactly as I wrote a few e-mails back in this thread, you can do
this with a vertex-centric iteration :-)
All you need to do is call "myGraph.runVertexCentricIteration(new
MyUpdateFunction(), new MyMessagingFunction(), maxIterations)"
and define MyUpdateFunction and MyMessagingFunction.
T
Hi Vasia,
for compute subgraph for Person I mean exactly all the vertices that
can be reached
starting from this node and following the graph edges.
I drafted the graph as a set of vertices (where the id is the subject of
the set of triples and the value is all of its triples)
and a set of edges (p
Hi Flavio,
I'm not quite familiar with RDF or sparql, so not all of your code is clear
to me.
Your first TODO is "compute subgraph for Person". Is "Person" a vertex id
in your graph? A vertex value?
And by "subgraph of Person", do you mean all the vertices that can be
reached starting from this n
Hi to all,
I made a simple RDF Gelly test and I shared it on my github repo at
https://github.com/fpompermaier/rdf-gelly-test.
I basically setup the Gelly stuff but I can't proceed and compute the
drafted TODOs.
Could someone help me and implementing them..?
I think this could become a nice example
Thanks Vasiliki,
when I'll find the time I'll try to make a quick prototype using the
pointers you suggested!
Thanks for the support,
Flavio
On Mon, Mar 23, 2015 at 10:31 AM, Vasiliki Kalavri <
vasilikikala...@gmail.com> wrote:
> Hi Flavio,
>
> I'm not familiar with JSON-LD, but as far as I unde
Hi Flavio,
I'm not familiar with JSON-LD, but as far as I understand, you want to
generate some trees from selected root nodes.
Once you have created the Graph as Andra describes above, you can first
filter out the edges that are of no interest to you, using filterOnEdges.
There is a description
Thanks Andrea for the help!
For graph generation I mean that I'd like to materialize subgraphs of my
overall knowledge starting from some root nodes whose rdf type is of
interest (something similar to what JSON-LD does). Is that clear?
On Mar 22, 2015 1:09 PM, "Andra Lungu" wrote:
> Hi Flavio,
>
Hi Flavio,
We don't have a specific example for generating RDF graphs using Gelly, but
I will try to drop some lines of code here and hope you will find them
useful.
An RDF statement is formed of Subject - Predicate - Object triples. In Edge
notation, the Subject and the Object will be the source
Is there anu example about rdf graph generation based on a skeleton
structure?
On Mar 22, 2015 12:28 PM, "Fabian Hueske" wrote:
> Hi Flavio,
>
> also, Gelly is a superset of Spargel. It provides the same features and
> much more.
>
> Since RDF is graph-structured, Gelly might be a good fit for yo
Hi Flavio,
also, Gelly is a superset of Spargel. It provides the same features and
much more.
Since RDF is graph-structured, Gelly might be a good fit for your use case.
Cheers, Fabian
Gelly has a section in the docs, it should explain the vertex-centric
iterations. Is that not extensive enough?
Am 22.03.2015 12:04 schrieb "Flavio Pompermaier" :
> Hi Stephan,
> thanks for the response. Unfortunately I'm not familiar with the new Gelly
> APIs and the old Spargel ones (I still don
Hi Stephan,
thanks for the response. Unfortunately I'm not familiar with the new Gelly
APIs and the old Spargel ones (I still don't understand the difference
actually).
Do you think it is possible to add such an example to the
documentation/examples?
Best,
Flavio
On Sat, Mar 21, 2015 at 7:48 PM
Hi Flavio!
I see initially two ways of doing this:
1) Do a series of joins. You start with your subject and join two or three
times using the "objects-from-triplets == subject" to make one hop. You can
filter the verbs from the triplets before if you are only interested in a
special relationship.
Hi to all,
I'm back to this task again :)
Summarizing again: I have some source dataset that has contains RDF "stars"
(SubjectURI, RdfType and a list of RDF triples belonging to this subject ->
the "a.k.a." star schema)
and I have to extract some sub-graphs for some RDF types of interest.
As descr
Hi Flavio,
if you want to use Gelly to model your data as a graph, you can load your
Tuple3s as Edges.
This will result in "http://test/John";, "Person", "Frank", etc to be
vertices and "type", "name", "knows" to be edge values.
In the first case, you can use filterOnEdges() to get the subgraph wi
I have a nice case of RDF manipulation :)
Let's say I have the following RDF triples (Tuple3) in two files or tables:
TABLE A:
http://test/John, type, Person
http://test/John, name, John
http://test/John, knows, http://test/Mary
http://test/John, knows, http://test/Jerry
http://test/Jerry, type, P
Hey Santosh!
RDF processing often involves either joins, or graph-query like operations
(transitive). Flink is fairly good at both types of operations.
I would look into the graph examples and the graph API for a start:
- Graph examples:
https://github.com/apache/flink/tree/master/flink-example
Hi Santosh,
I'm not aware of any existing tools in Flink to process RDFs. However,
Flink should be useful for processing such data.
You can probably use an existing RDF parser for Java to get the data into
the system.
Best,
Robert
On Fri, Feb 27, 2015 at 4:48 PM, santosh_rajaguru wrote:
> Hell
18 matches
Mail list logo
