benwtrent commented on PR #12434: URL: https://github.com/apache/lucene/pull/12434#issuecomment-1658402079
> If it's a small number (say c children per parent), it may be better to use KNN search with K' = c * K. It would be interesting to compare these two approaches to see if we can provide some guidance or even some kind of api that chooses? @msokolov I have had similar thoughts. I think this type of optimization could be done even if there aren't any child filters. What about the case where every parent has a single child? It's definitely better to gather the vectors from the sparse index and then join back (.e.g post filter) on the parent docs. The calculation would be something like `K' = max(c) * K` and then join after gathering the results. This could be revisited after this initial work is completed. -- 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
