title: Arbitrary path length query in SPARQL
body: <p>Is it possible to do arbitrary length of path queries in SPARQL. Lets say i have neo4j store which has a graph that only represents PARENT_OF relationships (consider a family tree for example). A cypher query to get all ancestors of a person would look like </p>
  
  <pre><code>start n (some node from index query) match n&lt;-[:PARENT_OF*]-k return k
  </code></pre>
  
  <p>How would this query look like in SPARQL if this neo store were to be represented as a RDF based triple store. Is this even possible. </p>