Browse wiki

From Semantic Portal Wiki

Jump to: navigation, search
Medha GRIN Presentation Jesse Weaver
Modification dateThis property is a special property in this wiki. 16 October 2008 19:52:05  +
Question answer Yes, I guess predicate can be unbound, b Yes, I guess predicate can be unbound, because an unbound predicate an be simply represented as a wildcard, but you have specify the path length. While this is my understanding, it depends on the subgraph matching algorithm that they use after identifying portions of the original RDF graph to be searched for finding variable bindings. I have not looked at the subgraph matching algorithm and hence cannot authoritatively say whether queries without bound predicates will work or not. without bound predicates will work or not.
Question asked Does this approach allow for variable predicates?
Question asked by Jesse Weaver +
Question for the Presentation Medha GRIN Presentation +
Categories Presentation Questions
hide properties that link here 
  No properties link to this page.
 

 

Enter the name of the page to start browsing from.
Views
Personal tools
Semantic Web Community
Tetherless World constellation
maintenance
Toolbox