Extract Graph from DBpedia, by number of HOPS, Direction

Asked Feb 19 '19 at 20:03

Active Feb 19 '19 at 21:15

Viewed 187 times

In the above graph [which is in dbpedia], I want to extract information about TIM COOK, with hops, IF I put hop as 1, I would need all the first level information about TIM COOK, like Masters, APPLE, Car

If hops are 2, I need Masters, APPLE, Car, United States

Is there any way I could extract such graph ?

I would like to pass direction (Incoming, Outgoing) also to extract graph.

Could you please help me with SPARQL query?

edited Feb 19 '19 at 21:15

marc_s

732,580
175
1,330
1,459

asked Feb 19 '19 at 20:03

Chaitanya Patil

is possible to some extent via SPARQL, yes. Just use a `CONSTRUCT` query with the appropriate triple patterns – UninformedUser Feb 19 '19 at 20:19
@AKSW Thanq SO much.. could you please suggest any tutorial on this, or any materials where i can study on this... – Chaitanya Patil Feb 19 '19 at 20:47
You simply have to read about RDF and SPARQL. Any SPARQL tutorial is sufficient to solve this, its basically defining a pattern that matches the subgraph you're interested – UninformedUser Feb 20 '19 at 06:31
Note, the subgraph can become pretty large, especially when also considering incoming edges and combination with authority nodes. – UninformedUser Feb 20 '19 at 06:32
hi @ChaitanyaPatil were you able to solve your problem, if done can you please share it – Shiva Rama Krishna Sep 19 '19 at 09:58

Extract Graph from DBpedia, by number of HOPS, Direction

0 Answers0

Linked