[
https://issues.apache.org/jira/browse/SOLR-8176?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15096707#comment-15096707
]
Joel Bernstein commented on SOLR-8176:
--------------------------------------
Thinking some about the machanics of what you're describing.
One possible approach to this is to shuffle results from an initial query to
worker nodes. Then the worker nodes persist the current working set locally.
Then the next iteration starts from the worker nodes that persisted the working
set. Each step in the traversal could be done like this. The effect would be
that the graph traversal would *hop* from one set of workers to another set of
workers with each iteration.
> Model distributed graph traversals with Streaming Expressions
> -------------------------------------------------------------
>
> Key: SOLR-8176
> URL: https://issues.apache.org/jira/browse/SOLR-8176
> Project: Solr
> Issue Type: New Feature
> Components: clients - java, SolrCloud, SolrJ
> Affects Versions: Trunk
> Reporter: Joel Bernstein
> Labels: Graph
> Fix For: Trunk
>
>
> I think it would be useful to model a few *distributed graph traversal* use
> cases with Solr's *Streaming Expression* language. This ticket will explore
> different approaches with a goal of implementing two or three common graph
> traversal use cases.
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
