[jira] [Updated] (SOLR-8888) Add shortestPath Streaming Expression
[
https://issues.apache.org/jira/browse/SOLR-?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Cao Manh Dat updated SOLR-:
---
Attachment: SOLR-.1.patch
> Add shortestPath Streaming Expression
> -
>
> Key: SOLR-
> URL: https://issues.apache.org/jira/browse/SOLR-
> Project: Solr
> Issue Type: Improvement
>Affects Versions: 6.1
>Reporter: Joel Bernstein
> Fix For: 6.1
>
> Attachments: SOLR-.1.patch, SOLR-.patch, SOLR-.patch,
> SOLR-.patch, SOLR-.patch, SOLR-.patch, SOLR-.patch,
> SOLR-.patch, SOLR-.patch, SOLR-.patch
>
>
> This ticket is to implement a distributed shortest path graph traversal as a
> Streaming Expression.
> Expression syntax:
> {code}
> shortestPath(collection,
> from="j...@company.com",
> to="j...@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
> j...@company.com and searches for the node j...@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-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org
[jira] [Updated] (SOLR-8888) Add shortestPath Streaming Expression
[
https://issues.apache.org/jira/browse/SOLR-?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Cao Manh Dat updated SOLR-:
---
Attachment: (was: SOLR-.patch)
> Add shortestPath Streaming Expression
> -
>
> Key: SOLR-
> URL: https://issues.apache.org/jira/browse/SOLR-
> Project: Solr
> Issue Type: Improvement
>Affects Versions: 6.1
>Reporter: Joel Bernstein
> Fix For: 6.1
>
> Attachments: SOLR-.patch, SOLR-.patch, SOLR-.patch,
> SOLR-.patch, SOLR-.patch, SOLR-.patch, SOLR-.patch,
> SOLR-.patch, SOLR-.patch
>
>
> This ticket is to implement a distributed shortest path graph traversal as a
> Streaming Expression.
> Expression syntax:
> {code}
> shortestPath(collection,
> from="j...@company.com",
> to="j...@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
> j...@company.com and searches for the node j...@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-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org
[jira] [Updated] (SOLR-8888) Add shortestPath Streaming Expression
[
https://issues.apache.org/jira/browse/SOLR-?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Cao Manh Dat updated SOLR-:
---
Attachment: SOLR-.patch
I just wanna refactor the code a little bit.
[~joel.bernstein] Please review.
> Add shortestPath Streaming Expression
> -
>
> Key: SOLR-
> URL: https://issues.apache.org/jira/browse/SOLR-
> Project: Solr
> Issue Type: Improvement
>Affects Versions: 6.1
>Reporter: Joel Bernstein
> Fix For: 6.1
>
> Attachments: SOLR-.patch, SOLR-.patch, SOLR-.patch,
> SOLR-.patch, SOLR-.patch, SOLR-.patch, SOLR-.patch,
> SOLR-.patch, SOLR-.patch, SOLR-.patch
>
>
> This ticket is to implement a distributed shortest path graph traversal as a
> Streaming Expression.
> Expression syntax:
> {code}
> shortestPath(collection,
> from="j...@company.com",
> to="j...@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
> j...@company.com and searches for the node j...@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-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org
[jira] [Updated] (SOLR-8888) Add shortestPath Streaming Expression
[
https://issues.apache.org/jira/browse/SOLR-?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Joel Bernstein updated SOLR-:
-
Affects Version/s: 6.1
> Add shortestPath Streaming Expression
> -
>
> Key: SOLR-
> URL: https://issues.apache.org/jira/browse/SOLR-
> Project: Solr
> Issue Type: Improvement
>Affects Versions: 6.1
>Reporter: Joel Bernstein
> Fix For: 6.1
>
> Attachments: SOLR-.patch, SOLR-.patch, SOLR-.patch,
> SOLR-.patch, SOLR-.patch, SOLR-.patch, SOLR-.patch,
> SOLR-.patch, SOLR-.patch
>
>
> This ticket is to implement a distributed shortest path graph traversal as a
> Streaming Expression.
> Expression syntax:
> {code}
> shortestPath(collection,
> from="j...@company.com",
> to="j...@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
> j...@company.com and searches for the node j...@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-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org
[jira] [Updated] (SOLR-8888) Add shortestPath Streaming Expression
[
https://issues.apache.org/jira/browse/SOLR-?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Joel Bernstein updated SOLR-:
-
Fix Version/s: 6.1
> Add shortestPath Streaming Expression
> -
>
> Key: SOLR-
> URL: https://issues.apache.org/jira/browse/SOLR-
> Project: Solr
> Issue Type: Improvement
>Reporter: Joel Bernstein
> Fix For: 6.1
>
> Attachments: SOLR-.patch, SOLR-.patch, SOLR-.patch,
> SOLR-.patch, SOLR-.patch, SOLR-.patch, SOLR-.patch,
> SOLR-.patch, SOLR-.patch
>
>
> This ticket is to implement a distributed shortest path graph traversal as a
> Streaming Expression.
> Expression syntax:
> {code}
> shortestPath(collection,
> from="j...@company.com",
> to="j...@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
> j...@company.com and searches for the node j...@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-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org
[jira] [Updated] (SOLR-8888) Add shortestPath Streaming Expression
[
https://issues.apache.org/jira/browse/SOLR-?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Joel Bernstein updated SOLR-:
-
Description:
This ticket is to implement a distributed shortest path graph traversal as a
Streaming Expression.
Expression syntax:
{code}
shortestPath(collection,
from="j...@company.com",
to="j...@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
j...@company.com and searches for the node j...@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.
was:
This ticket is to implement a distributed shortest path graph traversal as a
Streaming Expression.
Expression syntax:
{code}
shortestPath(collection,
from="j...@company.com",
to="j...@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
path in an unweighted, directed graph. The search starts from the node
j...@company.com and searches for the node j...@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.
> Add shortestPath Streaming Expression
> -
>
> Key: SOLR-
> URL: https://issues.apache.org/jira/browse/SOLR-
> Project: Solr
> Issue Type: Improvement
>Reporter: Joel Bernstein
> Attachments: SOLR-.patch, SOLR-.patch, SOLR-.patch,
> SOLR-.patch, SOLR-.patch, SOLR-.patch, SOLR-.patch,
> SOLR-.patch, SOLR-.patch
>
>
> This ticket is to implement a distributed shortest path graph traversal as a
> Streaming Expression.
> Expression syntax:
> {code}
> shortestPath(collection,
> from="j...@company.com",
> to="j...@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
> j...@company.com and searches for the node j...@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-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org
[jira] [Updated] (SOLR-8888) Add shortestPath Streaming Expression
[
https://issues.apache.org/jira/browse/SOLR-?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Joel Bernstein updated SOLR-:
-
Attachment: SOLR-.patch
Added GraphExpressionTests returning all the shortest paths found.
> Add shortestPath Streaming Expression
> -
>
> Key: SOLR-
> URL: https://issues.apache.org/jira/browse/SOLR-
> Project: Solr
> Issue Type: Improvement
>Reporter: Joel Bernstein
> Attachments: SOLR-.patch, SOLR-.patch, SOLR-.patch,
> SOLR-.patch, SOLR-.patch, SOLR-.patch, SOLR-.patch,
> SOLR-.patch, SOLR-.patch
>
>
> This ticket is to implement a distributed shortest path graph traversal as a
> Streaming Expression.
> Expression syntax:
> {code}
> shortestPath(collection,
> from="j...@company.com",
> to="j...@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
> path in an unweighted, directed graph. The search starts from the node
> j...@company.com and searches for the node j...@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-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org
[jira] [Updated] (SOLR-8888) Add shortestPath Streaming Expression
[
https://issues.apache.org/jira/browse/SOLR-?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Joel Bernstein updated SOLR-:
-
Attachment: SOLR-.patch
> Add shortestPath Streaming Expression
> -
>
> Key: SOLR-
> URL: https://issues.apache.org/jira/browse/SOLR-
> Project: Solr
> Issue Type: Improvement
>Reporter: Joel Bernstein
> Attachments: SOLR-.patch, SOLR-.patch, SOLR-.patch,
> SOLR-.patch, SOLR-.patch, SOLR-.patch, SOLR-.patch,
> SOLR-.patch
>
>
> This ticket is to implement a distributed shortest path graph traversal as a
> Streaming Expression.
> Expression syntax:
> {code}
> shortestPath(collection,
> from="j...@company.com",
> to="j...@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
> path in an unweighted, directed graph. The search starts from the node
> j...@company.com and searches for the node j...@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-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org
[jira] [Updated] (SOLR-8888) Add shortestPath Streaming Expression
[
https://issues.apache.org/jira/browse/SOLR-?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Joel Bernstein updated SOLR-:
-
Attachment: SOLR-.patch
New patch which returns all of the shortest paths. Manual tests look good but
more unit tests are needed with this algorithm.
> Add shortestPath Streaming Expression
> -
>
> Key: SOLR-
> URL: https://issues.apache.org/jira/browse/SOLR-
> Project: Solr
> Issue Type: Improvement
>Reporter: Joel Bernstein
> Attachments: SOLR-.patch, SOLR-.patch, SOLR-.patch,
> SOLR-.patch, SOLR-.patch, SOLR-.patch, SOLR-.patch
>
>
> This ticket is to implement a distributed shortest path graph traversal as a
> Streaming Expression.
> Expression syntax:
> {code}
> shortestPath(collection,
> from="j...@company.com",
> to="j...@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
> path in an unweighted, directed graph. The search starts from the node
> j...@company.com and searches for the node j...@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-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org
[jira] [Updated] (SOLR-8888) Add shortestPath Streaming Expression
[
https://issues.apache.org/jira/browse/SOLR-?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Joel Bernstein updated SOLR-:
-
Attachment: SOLR-.patch
> Add shortestPath Streaming Expression
> -
>
> Key: SOLR-
> URL: https://issues.apache.org/jira/browse/SOLR-
> Project: Solr
> Issue Type: Improvement
>Reporter: Joel Bernstein
> Attachments: SOLR-.patch, SOLR-.patch, SOLR-.patch,
> SOLR-.patch, SOLR-.patch, SOLR-.patch
>
>
> This ticket is to implement a distributed shortest path graph traversal as a
> Streaming Expression.
> Expression syntax:
> {code}
> shortestPath(collection,
> from="j...@company.com",
> to="j...@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
> path in an unweighted, directed graph. The search starts from the node
> j...@company.com and searches for the node j...@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-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org
[jira] [Updated] (SOLR-8888) Add shortestPath Streaming Expression
[
https://issues.apache.org/jira/browse/SOLR-?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Joel Bernstein updated SOLR-:
-
Attachment: SOLR-.patch
Patch the StreamExpression methods implemented and Stream Exrpression test cases
> Add shortestPath Streaming Expression
> -
>
> Key: SOLR-
> URL: https://issues.apache.org/jira/browse/SOLR-
> Project: Solr
> Issue Type: Improvement
>Reporter: Joel Bernstein
> Attachments: SOLR-.patch, SOLR-.patch, SOLR-.patch,
> SOLR-.patch, SOLR-.patch
>
>
> This ticket is to implement a distributed shortest path graph traversal as a
> Streaming Expression.
> Expression syntax:
> {code}
> shortestPath(collection,
> from="j...@company.com",
> to="j...@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
> path in an unweighted, directed graph. The search starts from the node
> j...@company.com and searches for the node j...@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-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org
[jira] [Updated] (SOLR-8888) Add shortestPath Streaming Expression
[
https://issues.apache.org/jira/browse/SOLR-?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Joel Bernstein updated SOLR-:
-
Description:
This ticket is to implement a distributed shortest path graph traversal as a
Streaming Expression.
Expression syntax:
{code}
shortestPath(collection,
from="j...@company.com",
to="j...@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
path in an unweighted, directed graph. The search starts from the node
j...@company.com and searches for the node j...@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.
was:
This ticket is to implement a distributed shortest path graph traversal as a
Streaming Expression.
Expression syntax:
{code}
shortestPath(collection,
from="j...@company.com",
to="j...@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
path in an unweighted, directed graph. The search starts from the node
j...@company.com and searches for the node j...@company.com, traversing the
*edge* 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.
> Add shortestPath Streaming Expression
> -
>
> Key: SOLR-
> URL: https://issues.apache.org/jira/browse/SOLR-
> Project: Solr
> Issue Type: Improvement
>Reporter: Joel Bernstein
> Attachments: SOLR-.patch, SOLR-.patch, SOLR-.patch,
> SOLR-.patch
>
>
> This ticket is to implement a distributed shortest path graph traversal as a
> Streaming Expression.
> Expression syntax:
> {code}
> shortestPath(collection,
> from="j...@company.com",
> to="j...@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
> path in an unweighted, directed graph. The search starts from the node
> j...@company.com and searches for the node j...@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-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org
[jira] [Updated] (SOLR-8888) Add shortestPath Streaming Expression
[
https://issues.apache.org/jira/browse/SOLR-?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Joel Bernstein updated SOLR-:
-
Description:
This ticket is to implement a distributed shortest path graph traversal as a
Streaming Expression.
Expression syntax:
{code}
shortestPath(collection,
from="j...@company.com",
to="j...@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
path in an unweighted, directed graph. The search starts from the node
j...@company.com and searches for the node j...@company.com, traversing the
*edge* 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.
was:
This ticket is to implement a distributed shortest path graph traversal as a
Streaming Expression.
Expression syntax:
{code}
shortestPath(collection,
from="j...@company.com",
to="j...@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
path in an unweighted, directed graph. The search starts from the node
j...@company.com and searches for the node j...@company.com, traversing the
*edge* 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.
> Add shortestPath Streaming Expression
> -
>
> Key: SOLR-
> URL: https://issues.apache.org/jira/browse/SOLR-
> Project: Solr
> Issue Type: Improvement
>Reporter: Joel Bernstein
> Attachments: SOLR-.patch, SOLR-.patch, SOLR-.patch,
> SOLR-.patch
>
>
> This ticket is to implement a distributed shortest path graph traversal as a
> Streaming Expression.
> Expression syntax:
> {code}
> shortestPath(collection,
> from="j...@company.com",
> to="j...@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
> path in an unweighted, directed graph. The search starts from the node
> j...@company.com and searches for the node j...@company.com, traversing the
> *edge* 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-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org
[jira] [Updated] (SOLR-8888) Add shortestPath Streaming Expression
[
https://issues.apache.org/jira/browse/SOLR-?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Joel Bernstein updated SOLR-:
-
Description:
This ticket is to implement a distributed shortest path graph traversal as a
Streaming Expression.
Expression syntax:
{code}
shortestPath(collection,
from="j...@company.com",
to="j...@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
path in an unweighted, directed graph. The search starts from the node
j...@company.com and searches for the node j...@company.com, traversing the
*edge* 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.
was:
This ticket is to implement a distributed shortest path graph traversal as a
Streaming Expression.
Expression syntax:
{code}
shortestPath(collection,
from="node1",
to="node2",
edge="colA=colB",
threads="6",
partitionSize="300",
fq="limiting query",
maxDepth="4")
{code}
The expression above performs a *breadth first search* to find the shortest
path in an unweighted, directed graph. The search is performed *from* node1
*to* node2, traversing the *edge* *joining* colA to colB iteratively. 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.
> Add shortestPath Streaming Expression
> -
>
> Key: SOLR-
> URL: https://issues.apache.org/jira/browse/SOLR-
> Project: Solr
> Issue Type: Improvement
>Reporter: Joel Bernstein
> Attachments: SOLR-.patch, SOLR-.patch, SOLR-.patch,
> SOLR-.patch
>
>
> This ticket is to implement a distributed shortest path graph traversal as a
> Streaming Expression.
> Expression syntax:
> {code}
> shortestPath(collection,
> from="j...@company.com",
> to="j...@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
> path in an unweighted, directed graph. The search starts from the node
> j...@company.com and searches for the node j...@company.com, traversing the
> *edge* 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-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org
[jira] [Updated] (SOLR-8888) Add shortestPath Streaming Expression
[
https://issues.apache.org/jira/browse/SOLR-?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Joel Bernstein updated SOLR-:
-
Description:
This ticket is to implement a distributed shortest path graph traversal as a
Streaming Expression.
Expression syntax:
{code}
shortestPath(collection,
from="node1",
to="node2",
edge="colA=colB",
threads="6",
partitionSize="300",
fq="limiting query",
maxDepth="4")
{code}
The expression above performs a *breadth first search* to find the shortest
path in an unweighted, directed graph. The search is performed *from* node1
*to* node2, traversing the *edge* *joining* colA to colB iteratively. 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.
was:
This ticket is to implement a distributed shortest path graph traversal as a
Streaming Expression.
Expression syntax:
{code}
shortestPath(collection,
from="node1",
to="node2",
edge="colA=colB",
threads="6",
partitionSize="300",
fq="limiting query",
maxDepth="4")
{code}
The expression above performs a *breadth first search* to find the shortest
path in an unweighted, directed graph. The search is performed *from* node1
*to* node2, traversing the *edge* *joining* colA to colB iteratively. Each
level in the traversal is implemented as a *parallel partitioned* nested loop
join. 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.
> Add shortestPath Streaming Expression
> -
>
> Key: SOLR-
> URL: https://issues.apache.org/jira/browse/SOLR-
> Project: Solr
> Issue Type: Improvement
>Reporter: Joel Bernstein
> Attachments: SOLR-.patch, SOLR-.patch, SOLR-.patch,
> SOLR-.patch
>
>
> This ticket is to implement a distributed shortest path graph traversal as a
> Streaming Expression.
> Expression syntax:
> {code}
> shortestPath(collection,
> from="node1",
> to="node2",
> edge="colA=colB",
> threads="6",
> partitionSize="300",
> fq="limiting query",
> maxDepth="4")
> {code}
> The expression above performs a *breadth first search* to find the shortest
> path in an unweighted, directed graph. The search is performed *from* node1
> *to* node2, traversing the *edge* *joining* colA to colB iteratively. 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-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org
[jira] [Updated] (SOLR-8888) Add shortestPath Streaming Expression
[
https://issues.apache.org/jira/browse/SOLR-?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Joel Bernstein updated SOLR-:
-
Description:
This ticket is to implement a distributed shortest path graph traversal as a
Streaming Expression.
Expression syntax:
{code}
shortestPath(collection,
from="node1",
to="node2",
edge="colA=colB",
threads="6",
partitionSize="300",
fq="limiting query",
maxDepth="4")
{code}
The expression above performs a *breadth first search* to find the shortest
path in an unweighted, directed graph. The search is performed *from* node1
*to* node2, traversing the *edge* *joining* colA to colB iteratively. Each
level in the traversal is implemented as a *parallel partitioned* nested loop
join. 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.
was:
This ticket is to implement a distributed shortest path graph traversal as a
Streaming Expression.
Expression syntax:
{code}
shortestPath(collection,
from="node1",
to="node2",
edge="colA=colB",
threads="6",
partitionSize="300",
fq="limiting query",
maxDepth="4")
{code}
Th expression above performs a *breadth first search* to find the shortest path
in an unweighted, directed graph. The search is performed *from* node1 *to*
node2, traversing the *edge* *joining* colA to colB iteratively. Each level in
the traversal is implemented as a *parallel partitioned* nested loop join. 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.
> Add shortestPath Streaming Expression
> -
>
> Key: SOLR-
> URL: https://issues.apache.org/jira/browse/SOLR-
> Project: Solr
> Issue Type: Improvement
>Reporter: Joel Bernstein
> Attachments: SOLR-.patch, SOLR-.patch, SOLR-.patch,
> SOLR-.patch
>
>
> This ticket is to implement a distributed shortest path graph traversal as a
> Streaming Expression.
> Expression syntax:
> {code}
> shortestPath(collection,
> from="node1",
> to="node2",
> edge="colA=colB",
> threads="6",
> partitionSize="300",
> fq="limiting query",
> maxDepth="4")
> {code}
> The expression above performs a *breadth first search* to find the shortest
> path in an unweighted, directed graph. The search is performed *from* node1
> *to* node2, traversing the *edge* *joining* colA to colB iteratively. Each
> level in the traversal is implemented as a *parallel partitioned* nested loop
> join. 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-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org
[jira] [Updated] (SOLR-8888) Add shortestPath Streaming Expression
[
https://issues.apache.org/jira/browse/SOLR-?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Joel Bernstein updated SOLR-:
-
Description:
This ticket is to implement a distributed shortest path graph traversal as a
Streaming Expression.
Expression syntax:
{code}
shortestPath(collection,
from="node1",
to="node2",
edge="colA=colB",
threads="6",
partitionSize="300",
fq="limiting query",
maxDepth="4")
{code}
Th expression above performs a *breadth first search* to find the shortest path
in an unweighted, directed graph. The search is performed *from* node1 *to*
node2, traversing the *edge* *joining* colA to colB iteratively. Each level in
the traversal is implemented as a *parallel partitioned* nested loop join. 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.
was:
This ticket is to implement a distributed shortest path graph traversal as a
Streaming Expression.
Expression syntax:
{code}
shortestPath(collection,
from="node1",
to="node2",
edge="colA, colB",
threads="6",
partitionSize="300",
fq="limiting query",
maxDepth="4")
{code}
Th expression above performs a *breadth first search* to find the shortest path
in an unweighted, directed graph. The search is performed *from* node1 *to*
node2, traversing the *edge* columns colA to colB iteratively. Each level in
the traversal is implemented as a *parallel partitioned* nested loop join. 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.
> Add shortestPath Streaming Expression
> -
>
> Key: SOLR-
> URL: https://issues.apache.org/jira/browse/SOLR-
> Project: Solr
> Issue Type: Improvement
>Reporter: Joel Bernstein
> Attachments: SOLR-.patch, SOLR-.patch, SOLR-.patch,
> SOLR-.patch
>
>
> This ticket is to implement a distributed shortest path graph traversal as a
> Streaming Expression.
> Expression syntax:
> {code}
> shortestPath(collection,
> from="node1",
> to="node2",
> edge="colA=colB",
> threads="6",
> partitionSize="300",
> fq="limiting query",
> maxDepth="4")
> {code}
> Th expression above performs a *breadth first search* to find the shortest
> path in an unweighted, directed graph. The search is performed *from* node1
> *to* node2, traversing the *edge* *joining* colA to colB iteratively. Each
> level in the traversal is implemented as a *parallel partitioned* nested loop
> join. 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-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org
[jira] [Updated] (SOLR-8888) Add shortestPath Streaming Expression
[
https://issues.apache.org/jira/browse/SOLR-?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Joel Bernstein updated SOLR-:
-
Description:
This ticket is to implement a distributed shortest path graph traversal as a
Streaming Expression.
Expression syntax:
{code}
shortestPath(collection,
from="node1",
to="node2",
edge="colA, colB",
threads="6",
partitionSize="300",
fq="limiting query",
maxDepth="4")
{code}
Th expression above performs a *breadth first search* to find the shortest path
in an unweighted, directed graph. The search is performed *from* node1 *to*
node2, traversing the *edge* columns colA to colB iteratively. Each level in
the traversal is implemented as a *parallel partitioned* nested loop join. 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.
was:
This ticket is to implement a distributed shortest path graph traversal as a
Streaming Expression.
Expression syntax:
{code}
shortestPath(collection,
from="node1",
to="node2",
edge="colA, colB",
threads="6",
partitionSize="300",
fq="limiting query",
maxDepth="4")
{code}
Th expression above performs a *breadth first search* to find the shortest path
in an unweighted, directed graph. The search is performed *from* node1 *to*
node2, traversing the *edge* columns colA to colB iteratively. Each level in
the traversal is implemented as a *parallel partitioned* nested loop join. The
*threads* parameter controls the number of threads performing the join. 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.
> Add shortestPath Streaming Expression
> -
>
> Key: SOLR-
> URL: https://issues.apache.org/jira/browse/SOLR-
> Project: Solr
> Issue Type: Improvement
>Reporter: Joel Bernstein
> Attachments: SOLR-.patch, SOLR-.patch, SOLR-.patch,
> SOLR-.patch
>
>
> This ticket is to implement a distributed shortest path graph traversal as a
> Streaming Expression.
> Expression syntax:
> {code}
> shortestPath(collection,
> from="node1",
> to="node2",
> edge="colA, colB",
> threads="6",
> partitionSize="300",
> fq="limiting query",
> maxDepth="4")
> {code}
> Th expression above performs a *breadth first search* to find the shortest
> path in an unweighted, directed graph. The search is performed *from* node1
> *to* node2, traversing the *edge* columns colA to colB iteratively. Each
> level in the traversal is implemented as a *parallel partitioned* nested loop
> join. 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-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org
[jira] [Updated] (SOLR-8888) Add shortestPath Streaming Expression
[
https://issues.apache.org/jira/browse/SOLR-?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Joel Bernstein updated SOLR-:
-
Description:
This ticket is to implement a distributed shortest path graph traversal as a
Streaming Expression.
Expression syntax:
{code}
shortestPath(collection,
from="node1",
to="node2",
edge="colA, colB",
threads="6",
partitionSize="300",
fq="limiting query",
maxDepth="4")
{code}
Th expression above performs a *breadth first search* to find the shortest path
in an unweighted, directed graph. The search is performed *from* node1 *to*
node2, traversing the *edge* columns colA to colB iteratively. Each level in
the traversal is implemented as a *parallel partitioned* nested loop join. The
*threads* parameter controls the number of threads performing the join. 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.
was:
This ticket is to implement a distributed shortest path graph traversal as a
Streaming Expression.
Expression syntax:
{code}
shortestPath(collection,
from="node1",
to="node2",
edge="colA, colB",
threads="6",
partitionSize="300",
fq="limiting query",
maxDepth="4")
{code}
Th expression above performs a *breadth first search* to find the shortest path
in an unweighted, directed graph. The search is performed *from* node1 *to*
node2, traversing the *edge* columns colA to colB iteratively. Each level in
the traversal is implemented as a *parallel partitioned* nested loop join. The
*threads* parameter controls the number of threads performing the join. The
*partitionSize* controls the of number 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.
> Add shortestPath Streaming Expression
> -
>
> Key: SOLR-
> URL: https://issues.apache.org/jira/browse/SOLR-
> Project: Solr
> Issue Type: Improvement
>Reporter: Joel Bernstein
> Attachments: SOLR-.patch, SOLR-.patch, SOLR-.patch,
> SOLR-.patch
>
>
> This ticket is to implement a distributed shortest path graph traversal as a
> Streaming Expression.
> Expression syntax:
> {code}
> shortestPath(collection,
> from="node1",
> to="node2",
> edge="colA, colB",
> threads="6",
> partitionSize="300",
> fq="limiting query",
> maxDepth="4")
> {code}
> Th expression above performs a *breadth first search* to find the shortest
> path in an unweighted, directed graph. The search is performed *from* node1
> *to* node2, traversing the *edge* columns colA to colB iteratively. Each
> level in the traversal is implemented as a *parallel partitioned* nested loop
> join. The *threads* parameter controls the number of threads performing the
> join. 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-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org
[jira] [Updated] (SOLR-8888) Add shortestPath Streaming Expression
[
https://issues.apache.org/jira/browse/SOLR-?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Joel Bernstein updated SOLR-:
-
Description:
This ticket is to implement a distributed shortest path graph traversal as a
Streaming Expression.
Expression syntax:
{code}
shortestPath(collection,
from="node1",
to="node2",
edge="colA, colB",
threads="6",
partitionSize="300",
fq="limiting query",
maxDepth="4")
{code}
Th expression above performs a *breadth first search* to find the shortest path
in an unweighted, directed graph. The search is performed *from* node1 *to*
node2, traversing the *edge* columns colA to colB iteratively. Each level in
the traversal is implemented as a *parallel partitioned* nested loop join. The
*threads* parameter controls the number of threads performing the join. The
*partitionSize* controls the of number 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.
was:
This ticket is to implement a distributed shortest path graph traversal as a
Streaming Expression.
Expression syntax:
{code}
shortestPath(collection,
from="node1",
to="node2",
edge="colA, colB",
threads="6",
partitionSize="300",
fq="limiting query",
maxDepth="4")
{code}
Th expression above will find the shortest path in an unweighted, directed
graph *from* node1 *to* node2, traversing the *edge* columns colA to colB
iteratively. Each level in the traversal is implemented as a *parallel
partitioned* nested loop join. The *threads* parameter controls the number of
threads performing the join. The *partitionSize* controls the of number 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.
> Add shortestPath Streaming Expression
> -
>
> Key: SOLR-
> URL: https://issues.apache.org/jira/browse/SOLR-
> Project: Solr
> Issue Type: Improvement
>Reporter: Joel Bernstein
> Attachments: SOLR-.patch, SOLR-.patch, SOLR-.patch,
> SOLR-.patch
>
>
> This ticket is to implement a distributed shortest path graph traversal as a
> Streaming Expression.
> Expression syntax:
> {code}
> shortestPath(collection,
> from="node1",
> to="node2",
> edge="colA, colB",
> threads="6",
> partitionSize="300",
> fq="limiting query",
> maxDepth="4")
> {code}
> Th expression above performs a *breadth first search* to find the shortest
> path in an unweighted, directed graph. The search is performed *from* node1
> *to* node2, traversing the *edge* columns colA to colB iteratively. Each
> level in the traversal is implemented as a *parallel partitioned* nested loop
> join. The *threads* parameter controls the number of threads performing the
> join. The *partitionSize* controls the of number 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-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org
[jira] [Updated] (SOLR-8888) Add shortestPath Streaming Expression
[
https://issues.apache.org/jira/browse/SOLR-?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Joel Bernstein updated SOLR-:
-
Description:
This ticket is to implement a distributed shortest path graph traversal as a
Streaming Expression.
Expression syntax:
{code}
shortestPath(collection,
from="node1",
to="node2",
edge="colA, colB",
threads="6",
partitionSize="300",
fq="limiting query",
maxDepth="4")
{code}
Th expression above will find the shortest path in an unweighted, directed
graph *from* node1 *to* node2, traversing the *edge* columns colA to colB
iteratively. Each level in the traversal is implemented as a *parallel
partitioned* nested loop join. The *threads* parameter controls the number of
threads performing the join. The *partitionSize* controls the of number 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.
was:
This ticket is to implement a distributed shortest path graph traversal as a
Streaming Expression.
Expression syntax:
{code}
shortestPath(collection,
from="node1",
to="node2",
edge="colA, colB",
threads="6",
partitionSize="300",
fq="limiting query",
maxDepth="4")
{code}
Th expression above will find the shortest path in a directed graph *from*
node1 *to* node2, traversing the *edge* columns colA to colB iteratively. Each
level in the traversal is implemented as a *parallel partitioned* nested loop
join. The *threads* parameter controls the number of threads performing the
join. The *partitionSize* controls the of number 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.
> Add shortestPath Streaming Expression
> -
>
> Key: SOLR-
> URL: https://issues.apache.org/jira/browse/SOLR-
> Project: Solr
> Issue Type: Improvement
>Reporter: Joel Bernstein
> Attachments: SOLR-.patch, SOLR-.patch, SOLR-.patch,
> SOLR-.patch
>
>
> This ticket is to implement a distributed shortest path graph traversal as a
> Streaming Expression.
> Expression syntax:
> {code}
> shortestPath(collection,
> from="node1",
> to="node2",
> edge="colA, colB",
> threads="6",
> partitionSize="300",
> fq="limiting query",
> maxDepth="4")
> {code}
> Th expression above will find the shortest path in an unweighted, directed
> graph *from* node1 *to* node2, traversing the *edge* columns colA to colB
> iteratively. Each level in the traversal is implemented as a *parallel
> partitioned* nested loop join. The *threads* parameter controls the number of
> threads performing the join. The *partitionSize* controls the of number 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-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org
[jira] [Updated] (SOLR-8888) Add shortestPath Streaming Expression
[
https://issues.apache.org/jira/browse/SOLR-?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Joel Bernstein updated SOLR-:
-
Description:
This ticket is to implement a distributed shortest path graph traversal as a
Streaming Expression.
Expression syntax:
{code}
shortestPath(collection,
from="node1",
to="node2",
edge="colA, colB",
threads="6",
partitionSize="300",
fq="limiting query",
maxDepth="4")
{code}
Th expression above will find the shortest path in a directed graph *from*
node1 *to* node2, traversing the *edge* columns colA to colB iteratively. Each
level in the traversal is implemented as a *parallel partitioned* nested loop
join. The *threads* parameter controls the number of threads performing the
join. The *partitionSize* controls the of number 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.
was:
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.
> Add shortestPath Streaming Expression
> -
>
> Key: SOLR-
> URL: https://issues.apache.org/jira/browse/SOLR-
> Project: Solr
> Issue Type: Improvement
>Reporter: Joel Bernstein
> Attachments: SOLR-.patch, SOLR-.patch, SOLR-.patch,
> SOLR-.patch
>
>
> This ticket is to implement a distributed shortest path graph traversal as a
> Streaming Expression.
> Expression syntax:
> {code}
> shortestPath(collection,
> from="node1",
> to="node2",
> edge="colA, colB",
> threads="6",
> partitionSize="300",
> fq="limiting query",
> maxDepth="4")
> {code}
> Th expression above will find the shortest path in a directed graph *from*
> node1 *to* node2, traversing the *edge* columns colA to colB iteratively.
> Each level in the traversal is implemented as a *parallel partitioned* nested
> loop join. The *threads* parameter controls the number of threads performing
> the join. The *partitionSize* controls the of number 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.
--
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
[jira] [Updated] (SOLR-8888) Add shortestPath Streaming Expression
[
https://issues.apache.org/jira/browse/SOLR-?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Joel Bernstein updated SOLR-:
-
Description:
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.
was:
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.
> Add shortestPath Streaming Expression
> -
>
> Key: SOLR-
> URL: https://issues.apache.org/jira/browse/SOLR-
> Project: Solr
> Issue Type: Improvement
>Reporter: Joel Bernstein
> Attachments: SOLR-.patch, SOLR-.patch, SOLR-.patch,
> SOLR-.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
[jira] [Updated] (SOLR-8888) Add shortestPath Streaming Expression
[
https://issues.apache.org/jira/browse/SOLR-?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Joel Bernstein updated SOLR-:
-
Attachment: SOLR-.patch
New patch adds a subsort to the queries to ensure results are deterministic.
> Add shortestPath Streaming Expression
> -
>
> Key: SOLR-
> URL: https://issues.apache.org/jira/browse/SOLR-
> Project: Solr
> Issue Type: Improvement
>Reporter: Joel Bernstein
> Attachments: SOLR-.patch, SOLR-.patch, SOLR-.patch,
> SOLR-.patch
>
>
> 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: dev-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org
[jira] [Updated] (SOLR-8888) Add shortestPath Streaming Expression
[
https://issues.apache.org/jira/browse/SOLR-?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Joel Bernstein updated SOLR-:
-
Attachment: SOLR-.patch
Latest patch fixes bug found during manual testing with Enron email
> Add shortestPath Streaming Expression
> -
>
> Key: SOLR-
> URL: https://issues.apache.org/jira/browse/SOLR-
> Project: Solr
> Issue Type: Improvement
>Reporter: Joel Bernstein
> Attachments: SOLR-.patch, SOLR-.patch, SOLR-.patch
>
>
> 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: dev-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org
[jira] [Updated] (SOLR-8888) Add shortestPath Streaming Expression
[
https://issues.apache.org/jira/browse/SOLR-?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Joel Bernstein updated SOLR-:
-
Attachment: SOLR-.patch
Added first simple test case.
I'll also be testing with some scale using the Enron emails data set.
> Add shortestPath Streaming Expression
> -
>
> Key: SOLR-
> URL: https://issues.apache.org/jira/browse/SOLR-
> Project: Solr
> Issue Type: Improvement
>Reporter: Joel Bernstein
> Attachments: SOLR-.patch, SOLR-.patch
>
>
> 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: dev-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org
[jira] [Updated] (SOLR-8888) Add shortestPath Streaming Expression
[
https://issues.apache.org/jira/browse/SOLR-?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Joel Bernstein updated SOLR-:
-
Attachment: SOLR-.patch
> Add shortestPath Streaming Expression
> -
>
> Key: SOLR-
> URL: https://issues.apache.org/jira/browse/SOLR-
> Project: Solr
> Issue Type: Improvement
>Reporter: Joel Bernstein
> Attachments: SOLR-.patch
>
>
> 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: dev-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org
[jira] [Updated] (SOLR-8888) Add shortestPath Streaming Expression
[
https://issues.apache.org/jira/browse/SOLR-?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Joel Bernstein updated SOLR-:
-
Description:
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.
was:
This ticket is to implement a distributed shortest path graph traversal as a
Streaming Expression.
possible expression syntax:
{code}
shortestPath(collection, colA="node1", 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.
> Add shortestPath Streaming Expression
> -
>
> Key: SOLR-
> URL: https://issues.apache.org/jira/browse/SOLR-
> 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: dev-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org
[jira] [Updated] (SOLR-8888) Add shortestPath Streaming Expression
[
https://issues.apache.org/jira/browse/SOLR-?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Joel Bernstein updated SOLR-:
-
Description:
This ticket is to implement a distributed shortest path graph traversal as a
Streaming Expression.
possible expression syntax:
{code}
shortestPath(collection, colA="node1", 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.
was:
This ticket is to implement a distributed shortest path graph traversal as a
Streaming Expression.
possible expression syntax:
shortestPath(collection, colA="node1", colB="node2", fq="limiting query",
maxDepth="10")
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.
> Add shortestPath Streaming Expression
> -
>
> Key: SOLR-
> URL: https://issues.apache.org/jira/browse/SOLR-
> 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, colA="node1", 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: dev-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org
[jira] [Updated] (SOLR-8888) Add shortestPath Streaming Expression
[ https://issues.apache.org/jira/browse/SOLR-?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ] Joel Bernstein updated SOLR-: - Description: This ticket is to implement a distributed shortest path graph traversal as a Streaming Expression. possible expression syntax: shortestPath(collection, colA="node1", colB="node2", fq="limiting query", maxDepth="10") 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. was: This ticket is to implement a distributed shortest path graph traversal as a Streaming Expression. possible expression syntax: shortestPath(collection, colA="node1", colB="node2", fq="limiting query") 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. > Add shortestPath Streaming Expression > - > > Key: SOLR- > URL: https://issues.apache.org/jira/browse/SOLR- > 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: > shortestPath(collection, colA="node1", colB="node2", fq="limiting query", > maxDepth="10") > 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
[jira] [Updated] (SOLR-8888) Add shortestPath Streaming Expression
[ https://issues.apache.org/jira/browse/SOLR-?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ] Joel Bernstein updated SOLR-: - Description: This ticket is to implement a distributed shortest path graph traversal as a Streaming Expression. possible expression syntax: shortestPath(collection, colA="node1", colB="node2", fq="limiting query") 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. was: This ticket is to implement a distributed shortest path graph traversal as a Streaming Expression. possible expression syntax: shortestPath(colA="node1", colB="node2", fq="limiting query") 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. > Add shortestPath Streaming Expression > - > > Key: SOLR- > URL: https://issues.apache.org/jira/browse/SOLR- > 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: > shortestPath(collection, colA="node1", colB="node2", fq="limiting query") > 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
[jira] [Updated] (SOLR-8888) Add shortestPath Streaming Expression
[ https://issues.apache.org/jira/browse/SOLR-?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ] Joel Bernstein updated SOLR-: - Description: This ticket is to implement a distributed shortest path graph traversal as a Streaming Expression. possible expression syntax: shortestPath(colA="node1", colB="node2", fq="limiting query") 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. was: This ticket is to implement a distributed shortest path graph traversal as a Streaming Expression. possible expression syntax: shortestPath(colA="node1", colB="node2") 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. > Add shortestPath Streaming Expression > - > > Key: SOLR- > URL: https://issues.apache.org/jira/browse/SOLR- > 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: > shortestPath(colA="node1", colB="node2", fq="limiting query") > 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
[jira] [Updated] (SOLR-8888) Add shortestPath Streaming Expression
[ https://issues.apache.org/jira/browse/SOLR-?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ] Joel Bernstein updated SOLR-: - Description: This ticket is to implement a distributed shortest path graph traversal as a Streaming Expression. possible expression syntax: shortestPath(colA="node1", colB="node2") 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. was: This ticket is to implement a distributed shortest path graph traversal as a Streaming Expression. possible expression syntax: shortestPath(colA="node1", colB="node2") This would start from colA:node1 and traverse from colA to colB iteratively until it finds colB:node2. The shortedPath function would emit Tuples representing the shortest path. > Add shortestPath Streaming Expression > - > > Key: SOLR- > URL: https://issues.apache.org/jira/browse/SOLR- > 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: > shortestPath(colA="node1", colB="node2") > 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. -- 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
