[
https://issues.apache.org/jira/browse/SOLR-8888?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15216038#comment-15216038
]
Dennis Gove edited comment on SOLR-8888 at 3/29/16 2:01 PM:
------------------------------------------------------------
I think the edge format should be an equality, like colA=colB
{code}
shortestPath(collection,
from="node1",
to="node2",
edge="colA=colB",
threads="6",
partitionSize="300",
fq="limiting query",
maxDepth="10")
{code}
Aside from the discussion above, this would allow situations where multiple
fields are used in the join
{code}
shortestPath(collection,
from="node1",
to="node2",
edge="colA=colB, colC=colD",
threads="6",
partitionSize="300",
fq="limiting query",
maxDepth="10")
{code}
was (Author: dpgove):
I think the edge format should be an equ
> Add shortestPath Streaming Expression
> -------------------------------------
>
> Key: SOLR-8888
> URL: https://issues.apache.org/jira/browse/SOLR-8888
> Project: Solr
> Issue Type: Improvement
> Reporter: Joel Bernstein
> Attachments: SOLR-8888.patch, SOLR-8888.patch, SOLR-8888.patch,
> SOLR-8888.patch
>
>
> This ticket is to implement a distributed shortest path graph traversal as a
> Streaming Expression.
> possible expression syntax:
> {code}
> shortestPath(collection,
> from="node1",
> to="node2",
> edge="colA,colB",
> threads="6",
> partitionSize="300",
> 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: dev-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org
