Hi all, How would you recommend doing path search queries in Virtuoso?
* Find the shortest path between two nodes using only predicate X * Find all the paths between two nodes using predicate X, Y and Z For some cases, I can imagine how I can pull this off using transitivity. For other cases, a bidirectional brute force search will surely work ( although its cost may be staggering ) Any thoughts? Thanks, A -- Aldo Bucchi skype:aldo.bucchi http://www.univrz.com/ http://aldobucchi.com/ PRIVILEGED AND CONFIDENTIAL INFORMATION This message is only for the use of the individual or entity to which it is addressed and may contain information that is privileged and confidential. If you are not the intended recipient, please do not distribute or copy this communication, by e-mail or otherwise. Instead, please notify us immediately by return e-mail.
