atris commented on issue #854: Shared PQ Based Early Termination for Concurrent Search URL: https://github.com/apache/lucene-solr/pull/854#issuecomment-530349367 > I think that you need to ensure that the slice publishing the new min score is full, otherwise the min score cannot be the global min score. If the other slices are not full they can use the new min score immediately but that's assuming that all slices have the same topN size. How about all slices continuously publishing their minimum score in a shared state but without synchronization (maybe a shared array of numSlices length?). Once globally, numHits are collected, we do a pass through the array and pick the minimum? This should have minimal memory footprint since the number of slices should be a small value
---------------------------------------------------------------- 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. For queries about this service, please contact Infrastructure at: [email protected] With regards, Apache Git Services --------------------------------------------------------------------- To unsubscribe, e-mail: [email protected] For additional commands, e-mail: [email protected]
