Medha GRIN Presentation Jesse Weaver
From Semantic Portal Wiki
- Question is for the Presentation: Medha GRIN Presentation
- Question is asked by: Jesse Weaver
- The Question is: Does this approach allow for variable predicates?
- Answer:
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.
Facts about Medha GRIN Presentation Jesse WeaverRDF feed
| 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 + |
