[jira] [Commented] (SOLR-8888) Add shortestPath Streaming Expression

["Joel Bernstein (JIRA)" <ji...@apache.org>]

    [ https://issues.apache.org/jira/browse/SOLR-8888?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15276343#comment-15276343 ] 

Joel Bernstein commented on SOLR-8888:
--------------------------------------

Thanks for the patcht! Let's create new for ticket for this though, something like "refactor shortestPath streaming expression".

> Add shortestPath Streaming Expression
> -------------------------------------
>
>                 Key: SOLR-8888
>                 URL: https://issues.apache.org/jira/browse/SOLR-8888
>             Project: Solr
>          Issue Type: Improvement
>    Affects Versions: 6.1
>            Reporter: Joel Bernstein
>             Fix For: 6.1
>
>         Attachments: SOLR-8888.1.patch, SOLR-8888.patch, SOLR-8888.patch, SOLR-8888.patch, SOLR-8888.patch, SOLR-8888.patch, 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.
> Expression syntax:
> {code}
> shortestPath(collection, 
>                      from="john@company.com", 
>                      to="jane@company.com",
>                      edge="from=to",
>                      threads="6",
>                      partitionSize="300", 
>                      fq="limiting query", 
>                      maxDepth="4")
> {code}
> The expression above performs a *breadth first search* to find the shortest paths in an unweighted, directed graph. The search starts from the node john@company.com  and searches for the node jane@company.com, traversing the *edges* by iteratively joining the *from* and *to* columns. Each level in the traversal is implemented as a *parallel partitioned* nested loop join across the entire *collection*. The *threads* parameter controls the number of threads performing the join at each level. The *partitionSize* controls the of number of nodes in each join partition. *maxDepth* controls the number of levels to traverse. *fq* is a limiting query applied to each level in the traversal.
> Future implementations can add more capabilities such as weighted traversals.



--
This message was sent by Atlassian JIRA
(v6.3.4#6332)

---------------------------------------------------------------------
To unsubscribe, e-mail: dev-unsubscribe@lucene.apache.org
For additional commands, e-mail: dev-help@lucene.apache.org