I have a full list of hierarchy in stardog DB for example
A knows B
A knows D
B knows C
C knows E
P knows Q
How can I query the database to get entire structure as graph in java.
For example I will pass A as a parameter
Since A knows B and D they should come
Since B knows C it should come
Since D knows E it should come
Since P or Q have any relation with A they should not come.
--
-- --
You received this message because you are subscribed to the C&P "Stardog" group.
To post to this group, send email to sta...@clarkparsia.com
To unsubscribe from this group, send email to
stardog+u...@clarkparsia.com
For more options, visit this group at
http://groups.google.com/a/clarkparsia.com/group/stardog?hl=en
My Ultimate requirement is I want to delete entire graph
Recursive execution of parametrized query is the only solution to get the handle of whole graph?
The predicate also not a constant
It should Identify the tuples given below.
A haveNumber 123
123 haveCode +01
If I delete A it should delete everything thats related to A
On Thursday, 18 April 2013 18:44:49 UTC+5:30, Evren Sirin wrote:
thank you for the idea of remover.
btw how to create an object of remover? Cant find it any sample codes any where.