Jena's SPARQL property paths will be supported as of TBC 3.0.0 which will go into public beta soon.
We could theoretically expose our existing shortest path algorithm (that is used in TopBraid Ensemble's graph component) via a SPARQL function. But I am not sure what the output would be - it depends on what you want to do with it. A path would need to be some data structure which you can then walk through in the next steps. Holger On Dec 12, 2008, at 1:57 PM, Schmitz, Jeffrey A wrote: > > Of course the jena board is probably a better place for these types > of questions. > > -----Original Message----- > From: donundeen [mailto:[email protected]] > Sent: Friday, December 12, 2008 3:41 PM > To: TopBraid Composer Users > Subject: [tbc-users] Re: RDF Path discovery > > > yeah, I was just checking that out. Very cool. > I don't see in the documentation, though, how I could express > arbitrary properties between two nodes. > I see in the examples how to say "Find a path from ?x consisting of > a bunch of foaf:knows, followed by foaf:name: > ?x foaf:knows+/foaf:name ?name . > > But in my case, i don't know what properties may be in between ?x > and ? > name; that's one of the things I want to find out. > > Do you know if this is possible in the current property path syntax? > I'd like to say something like (stealing from regex): > ?x .+/foaf:name ?name . > > Or (stealing from xpath) > > ?x //foaf:name ?name . > > meaning "find ANY path that ends in foaf:name " > > what do you think? > > On Dec 12, 3:42 pm, "Schmitz, Jeffrey A" > <[email protected]> wrote: >> Have you looked at the new jena property path stuff? Not sure if >> this >> is in the latest TBC, but if not it should be coming soon. >> >> http://jena.sourceforge.net/ARQ/property_paths.html >> >> Jeff >> >> -----Original Message----- >> From: donundeen [mailto:[email protected]] >> Sent: Friday, December 12, 2008 2:29 PM >> To: TopBraid Composer Users >> Subject: [tbc-users] RDF Path discovery >> >> Hi guys. >> What capabilities does TopBraid have in terms of finding paths >> between >> nodes. >> I know that in ensemble, you can put two nodes on the graph view, and >> then find the shortest path between those two nodes. >> >> That's great, but I'd like to take that idea a bit farther. I'm >> guessing that underneath the above ensemble feature, there's a >> library >> for doing this kind of path discovery. >> >> What I'd like to do is ask questions like "show me all instances of >> 'location' (or it's subclasses) that are connected to this resource X >> by any number of hops, but exclude paths that use properties a, b, >> and c" >> >> Experimentally, there's an extension to SPARQL called CPSPARQL, >> described here:http://exmo.inrialpes.fr/software/psparql/, which is >> pretty cool, though is super-beta, doesn't work on large datasets, >> etc >> etc. But it shows what I'm driving at. >> >> So, if not in TopBraid, have any of you see good libraries for doing >> this kind of work? >> >> thanks! >> >> don > > > > --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "TopBraid Composer Users" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/topbraid-composer-users?hl=en -~----------~----~----~----~------~----~------~--~---
