Re: graph query parser: depth dependent score?

2019-02-27 Thread Jochen Barth
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;

graph query parser: depth dependent score?

2019-02-19 Thread 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