gsmiller opened a new issue, #15934: URL: https://github.com/apache/lucene/issues/15934
### Description In our current implementation, we linearly scan an array of sorted docIDs and compare them to the docID boundary of the index leaves to partition them by leaf. I'm curious if a binary search approach might work better. The idea would be to iterate the leaves in order (which we're already doing) and bsearch the sorted docID array to find the "chunk" for that leaf. I suspect this might be more optimal for cases where the number of docIDs we're partitioning is >> than the leaf count (likely the common case). -- 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: [email protected] For queries about this service, please contact Infrastructure at: [email protected] --------------------------------------------------------------------- To unsubscribe, e-mail: [email protected] For additional commands, e-mail: [email protected]
