how to find multiple paths between classes in the ontology?

[Petar Jovanovic <pe...@gmail.com>]

Hi,
I found many threads about finding the shortest path and calculating
distance between two nodes in the ontology with Jena (OntTools class to be
precise).
However, I'm interested to find all the paths between two nodes and then to
let user for example choose the one he wants. Is there some method for
getting the set of all paths between two classes?

Thanks!

Re: how to find multiple paths between classes in the ontology?

[Petar Jovanovic <pe...@gmail.com>]

Thanks for the reference Mark.
I am fully aware of the high computational cost for such matter.
However, the ontology we are using in the domain, captutes the
semantics of the data sources and thus is not that large. Also we
prune the ontology paths with several conditions so again not all the
paths will be  in the result.


2013/2/1, Mark Bobick <mn...@westnet.com>:
> Petar,
>
> Look up "British Museum Search" - what you want to do has a high
> computation
> cost per instance in network objects of almost any useful size.  Even if
> you
> coded for maximum efficiency, you may not be able to offer such a feature
> (as a practical matter) for that reason alone.  Also, for large (enough)
> graphs, the process of providing a selection set to the user itself
> represents a challenge - you might have 100k paths to choose from.
>
> Regards,
>
> -mark bobick
>
> -----Original Message-----
> From: Petar Jovanovic [mailto:petar.kepha@gmail.com]
> Sent: Thursday, January 31, 2013 1:10 PM
> To: users@jena.apache.org
> Subject: how to find multiple paths between classes in the ontology?
>
> Hi,
> I found many threads about finding the shortest path and calculating
> distance between two nodes in the ontology with Jena (OntTools class to be
> precise).
> However, I'm interested to find all the paths between two nodes and then to
> let user for example choose the one he wants. Is there some method for
> getting the set of all paths between two classes?
>
> Thanks!
>
>

RE: how to find multiple paths between classes in the ontology?

[Mark Bobick <mn...@westnet.com>]

Petar,

Look up "British Museum Search" - what you want to do has a high computation
cost per instance in network objects of almost any useful size.  Even if you
coded for maximum efficiency, you may not be able to offer such a feature
(as a practical matter) for that reason alone.  Also, for large (enough)
graphs, the process of providing a selection set to the user itself
represents a challenge - you might have 100k paths to choose from.

Regards,

-mark bobick

-----Original Message-----
From: Petar Jovanovic [mailto:petar.kepha@gmail.com] 
Sent: Thursday, January 31, 2013 1:10 PM
To: users@jena.apache.org
Subject: how to find multiple paths between classes in the ontology?

Hi,
I found many threads about finding the shortest path and calculating
distance between two nodes in the ontology with Jena (OntTools class to be
precise).
However, I'm interested to find all the paths between two nodes and then to
let user for example choose the one he wants. Is there some method for
getting the set of all paths between two classes?

Thanks!

Re: how to find multiple paths between classes in the ontology?

[YU Fan <yu...@gmail.com>]

AFAIK, There is a tool http://viziquer.lumii.lv/ has such a function on its
feature list.


On Fri, Feb 1, 2013 at 3:22 AM, Dave Reynolds <da...@gmail.com>wrote:

> On 31/01/13 18:09, Petar Jovanovic wrote:
>
>> Hi,
>> I found many threads about finding the shortest path and calculating
>> distance between two nodes in the ontology with Jena (OntTools class to be
>> precise).
>> However, I'm interested to find all the paths between two nodes and then
>> to
>> let user for example choose the one he wants. Is there some method for
>> getting the set of all paths between two classes?
>>
>
> There's no build in operation like that but it'll be an easy piece of code
> for you to write.
>
> Dave
>
>
>

Re: how to find multiple paths between classes in the ontology?

[Dave Reynolds <da...@gmail.com>]

On 31/01/13 18:09, Petar Jovanovic wrote:
> Hi,
> I found many threads about finding the shortest path and calculating
> distance between two nodes in the ontology with Jena (OntTools class to be
> precise).
> However, I'm interested to find all the paths between two nodes and then to
> let user for example choose the one he wants. Is there some method for
> getting the set of all paths between two classes?

There's no build in operation like that but it'll be an easy piece of 
code for you to write.

Dave