Re: Graph Query Parser Syntax
Hi All ,
any suggestions?
On Fri, Feb 14, 2020 at 5:20 PM sambasivarao giddaluri <
sambasiva.giddal...@gmail.com> wrote:
> Hi All,
> In our project we have to use multiple graph queries with AND and OR
> conditions but graph query parser does not work for the below scenario, can
> any one suggest how to overcome this kind of problem? this is stopping our
> pre prod release .
> we are also using traversalFilter but our usecase still need multiple OR
> and AND graph query .
>
>
>
> *works*
> {!graph from=parentId to=parentId returnRoot=false}id:abc
> *works*
> ({!graph from=parentId to=parentId returnRoot=false}id:abc)
> *works*
> ({!graph from=parentId to=parentId returnRoot=false}id:abc AND name:test)
> *works*
> {!graph from=parentId to=parentId returnRoot=false}(id:abc AND name:test)
>
> *Fails Syntax Error *
> ({!graph from=parentId to=parentId returnRoot=false}(id:abc AND
> name:test))
>
> *Fails Syntax Error *
> ({!graph from=parentId to=parentId returnRoot=false}(id:abc AND
> name:test)) OR (({!graph from=parentId to=parentId
> returnRoot=false}(description :abc AND name:test))
>
>
> '(id:abc': Encountered \"\" at line 1, column 13.\nWas expecting one
> of:\n ...\n ...\n ...\n\"+\" ...\n\"-\"
> ...\n ...\n\"(\" ...\n\")\" ...\n\"*\" ...\n
> \"^\" ...\n ...\n ...\n ...\n
> ...\n ...\n ...\n\"[\"
> ...\n\"{\" ...\n ...\n\"filter(\" ...\n
> ...\n",
>
> Regards
> sam
>
>
>
Graph Query Parser Syntax
Hi All,
In our project we have to use multiple graph queries with AND and OR
conditions but graph query parser does not work for the below scenario, can
any one suggest how to overcome this kind of problem? this is stopping our
pre prod release .
we are also using traversalFilter but our usecase still need multiple OR
and AND graph query .
*works*
{!graph from=parentId to=parentId returnRoot=false}id:abc
*works*
({!graph from=parentId to=parentId returnRoot=false}id:abc)
*works*
({!graph from=parentId to=parentId returnRoot=false}id:abc AND name:test)
*works*
{!graph from=parentId to=parentId returnRoot=false}(id:abc AND name:test)
*Fails Syntax Error *
({!graph from=parentId to=parentId returnRoot=false}(id:abc AND name:test))
*Fails Syntax Error *
({!graph from=parentId to=parentId returnRoot=false}(id:abc AND
name:test)) OR (({!graph from=parentId to=parentId
returnRoot=false}(description :abc AND name:test))
'(id:abc': Encountered \"\" at line 1, column 13.\nWas expecting one
of:\n ...\n ...\n ...\n\"+\" ...\n\"-\"
...\n ...\n\"(\" ...\n\")\" ...\n\"*\" ...\n
\"^\" ...\n ...\n ...\n ...\n
...\n ...\n ...\n\"[\"
...\n\"{\" ...\n ...\n\"filter(\" ...\n
...\n",
Regards
sam
Re: Using Deep Paging with Graph Query Parser
: Is there a way to use combine paging's cursor feature with graph query : parser? it should work just fie -- the cursorMark logic doesn't care what query parser you use. Is there a particular problem you are running into when you send requests using both? -Hoss http://www.lucidworks.com/
Graph Query Parser with pagination
Hi All,
Is it possible to search on a index using graph query parser with
pagination available .
ex:
1 <--2<--3
1 <--4<--5
1 <--6<--7
and so on
1 is parent of 2,4 and 2 is parent of 3 and 4 is parent of 5
1 is doc type A and 2,4 are of type doc B and 3,5 are of type C
similarly if i have 200 children similar to 2,4,6
schema example:
doc A
{
id : 1
name: Laptop
}
doc B
{
id : 2
parent:1
name: Dell
}
doc C
{
id : 3
parent:2
mainparent:1
name: latitude 15inch
}
doc A
{
id : 1
name: Laptop
}
doc B
{
id : 4
parent:1
name: Dell Desktop
}
doc C
{
id : 5
parent:4
mainparent:1
name: latitude 15inch
}
So my query doc C.name=latitude 15inch and doc A.name=laptop
this will give me two results when from doc C if am using graph query
parser , but instead of getting all results in one call , can add some kind
of pagination .
Or any other suggestions ? which can be used to achieve the below results
where we multiple docs involved in query .
Regards
sambasiva
Using Deep Paging with Graph Query Parser
Is there a way to use combine paging's cursor feature with graph query parser? Background: I have a hierarchical data structure that is split into N different flat json docs and updated (inserted) into solr with from/to fields. Using the from/to join syntax a graph query is needed since different queries need parents (given certain child filters) and different queries need children (given certain parent filters). Graph query parser (though not distributed) looks ideal. However I need pagination to iterate on the results. Hints for custom code are ok, since current solr install has lots admin, core and collection handlers already running. -M -- Sent from: https://lucene.472066.n3.nabble.com/Solr-User-f472068.html
Re: graph query parser: depth dependent score?
Dear reader, I've found an different solution for my problem
and don't need a depth dependent score anymore.
Kind regards, Jochen
Am 19.02.19 um 14:42 schrieb Jochen Barth:
Dear reader,
I'll have a hierarchical graph "like a book":
{ id:solr_doc1; title:book }
{ id:solr_doc2; title:chapter; parent_ids: solr_doc1 }
{ id:solr_doc3; title:subchapter; parent_ids: solr_doc2 }
etc.
Now to match all docs with "title" and "chapter" I could do:
+_query_:"{!graph from=parent_ids to=id}title:book"
+_query_:"{!graph from=parent_ids to=id}title:chapter",
The result would be solr_doc2 and solr_doc3;
but is there a way to "boost" or "put a higher score" on solr_doc2
than on solr_doc3 because of direct match (and not via {!graph... ) ?
The only way to do so seems a {!boost before {!graph, but what I can
do there is not dependent on the match nor {!graph, I think.
Kind regards,
Jochen
--
Jochen Barth * Universitätsbibliothek Heidelberg, IT * Telefon 06221 54-2580
graph query parser: depth dependent score?
Dear reader,
I'll have a hierarchical graph "like a book":
{ id:solr_doc1; title:book }
{ id:solr_doc2; title:chapter; parent_ids: solr_doc1 }
{ id:solr_doc3; title:subchapter; parent_ids: solr_doc2 }
etc.
Now to match all docs with "title" and "chapter" I could do:
+_query_:"{!graph from=parent_ids to=id}title:book"
+_query_:"{!graph from=parent_ids to=id}title:chapter",
The result would be solr_doc2 and solr_doc3;
but is there a way to "boost" or "put a higher score" on solr_doc2 than
on solr_doc3 because of direct match (and not via {!graph... ) ?
The only way to do so seems a {!boost before {!graph, but what I can do
there is not dependent on the match nor {!graph, I think.
Kind regards,
Jochen
--
Jochen Barth * Universitätsbibliothek Heidelberg, IT * Telefon 06221 54-2580
Graph Query Parser
All, Is any one using graph query parser with Solr 6+ versions? Is that working fine as expected ? Can you guys guide me with some working data model and configurations to set ? I tried with sample provided over here https://cwiki.apache.org/confluence/display/solr/Other+Parsers#OtherParsers-GraphQueryParser But it's not working as expected. -- View this message in context: http://lucene.472066.n3.nabble.com/Graph-Query-Parser-tp405.html Sent from the Solr - User mailing list archive at Nabble.com.
Re: Graph Query Parser
If you're using Solr Cloud, the shortestPath streaming expression will do that for you: https://cwiki.apache.org/confluence/display/solr/Streaming+Expressions#StreamingExpressions-shortestPath Joel Bernstein http://joelsolr.blogspot.com/ On Tue, Aug 23, 2016 at 4:34 PM, Jigar Shah <jigaronl...@gmail.com> wrote: > Hello, > > I am trying to get "path" from root node to leaves using Graph Query > Parser. Graph Query Parser gives me all child nodes from root but not > specific paths. Can someone suggest how to get that? > > e.g: If i have parent to child relation as follows. > > A -> B,C -> D > > D is child of B and C and they are child of A. > > Expected result set: > > A/B/D > A/C/D > > Resultset should have ordered list from root to leaf, like we get in > hierarchical facet. > > Thanks, > Jigar Shah. >
Graph Query Parser
Hello, I am trying to get "path" from root node to leaves using Graph Query Parser. Graph Query Parser gives me all child nodes from root but not specific paths. Can someone suggest how to get that? e.g: If i have parent to child relation as follows. A -> B,C -> D D is child of B and C and they are child of A. Expected result set: A/B/D A/C/D Resultset should have ordered list from root to leaf, like we get in hierarchical facet. Thanks, Jigar Shah.
