SV: Iterative graph/nodes query

[Magnus Karlsson <ma...@ikama.se>]

Hi,


anyone using any of the functionality of graphs either in a single collection (shortest path) or streaming expressions (nodes)?


Experiences?


/ Magnus

________________________________
Från: Magnus Karlsson <ma...@ikama.se>
Skickat: den 17 december 2018 14:51:17
Till: solr-user@lucene.apache.org
Ämne: Iterative graph/nodes query

Hi,


looking at the graph traversal capabilities of solr. Is there a function/feature that traverses until certain pre-requisites are met?


For instance, in an hierarchical use case, "traverse all children until a child has a certain name or type"?


Using the current nodes streaming expression I need to know beforehand the number of levels I need to traverse.


Is there a feature supporting this use-case or is it planned to be implemented?


Thanks in advance.


/ Magnus

Re: Iterative graph/nodes query

[Dan M <mr...@gmail.com>]

Perhaps you're looking for the traversalFilter parameter of the graph query?

https://lucene.apache.org/solr/guide/7_6/other-parsers.html#graph-query-parser

Dan Meehl
Meehl Technology Solutions Inc


On Tue, Jan 22, 2019 at 7:13 AM Magnus Karlsson <ma...@ikama.se> wrote:

> Hi,
>
>
> anyone using any of the functionality of graphs either in a single
> collection (shortest path) or streaming expressions (nodes)?
>
>
> Experiences?
>
>
> / Magnus
>
> ________________________________
> Från: Magnus Karlsson <ma...@ikama.se>
> Skickat: den 17 december 2018 14:51:17
> Till: solr-user@lucene.apache.org
> Ämne: Iterative graph/nodes query
>
> Hi,
>
>
> looking at the graph traversal capabilities of solr. Is there a
> function/feature that traverses until certain pre-requisites are met?
>
>
> For instance, in an hierarchical use case, "traverse all children until a
> child has a certain name or type"?
>
>
> Using the current nodes streaming expression I need to know beforehand the
> number of levels I need to traverse.
>
>
> Is there a feature supporting this use-case or is it planned to be
> implemented?
>
>
> Thanks in advance.
>
>
> / Magnus
>
>