vigyasharma commented on PR #13525: URL: https://github.com/apache/lucene/pull/13525#issuecomment-2244027209
> Cohere's wikipedia embeddings all indicate their parent page. So, I wonder how this would work on finding the nearest page given the `maxsim(passage)` vs. using the Lucene join logic and putting the passages directly in the graph. @benwtrent : do we have any existing benchmarks for ParentJoin queries in knn? I didn't find it in `KnnGraphTester` and the benchmarking code I've looked at so far. I can add support for ParentJoin benchmarks but I see you ran something similar [here](https://github.com/apache/lucene/pull/12434#issuecomment-1750978708), so thought I'd check if we already have this available. -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: issues-unsubscr...@lucene.apache.org For queries about this service, please contact Infrastructure at: us...@infra.apache.org --------------------------------------------------------------------- To unsubscribe, e-mail: issues-unsubscr...@lucene.apache.org For additional commands, e-mail: issues-h...@lucene.apache.org
