[
https://issues.apache.org/jira/browse/SOLR-8888?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15209011#comment-15209011
]
Dennis Gove commented on SOLR-8888:
-----------------------------------
Oh I see. How about something that is explicit about what edge should be
followed
{code}
shortestPath(collection,
from="node1",
to="node2",
edge="colA=colB"
fq="limiting query",
maxDepth="10")
{code}
This would make the edge just a use of the FieldEqualitor and possibly simplify
the creation of the joins. Also, as we expand the set of FieldEqualitors the
graph queries can benefit.
As an example to the expansion of FieldEqualitor, though outside the scope of
this ticket, imagine a case where we'd want to say colA=colB+-5, which would
translate to two fields being within 5 of each other. An equalitor could be
created to support such a range case.
> Add shortestPath Streaming Expression
> -------------------------------------
>
> Key: SOLR-8888
> URL: https://issues.apache.org/jira/browse/SOLR-8888
> Project: Solr
> Issue Type: Improvement
> Reporter: Joel Bernstein
>
> This ticket is to implement a distributed shortest path graph traversal as a
> Streaming Expression.
> possible expression syntax:
> {code}
> shortestPath(collection,
> from="colA:node1",
> to="colB:node2",
> fq="limiting query",
> maxDepth="10")
> {code}
> This would start from colA:node1 and traverse from colA to colB iteratively
> until it finds colB:node2. The shortestPath function would emit Tuples
> representing the shortest path.
> The optional fq could be used to apply a filter on the traversal.
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
