gf2121 opened a new pull request, #12712: URL: https://github.com/apache/lucene/pull/12712
Based on the idea mentioned [here](https://github.com/apache/lucene/issues/12665#issuecomment-1774050262): > 1. If we use a stable sorter, we can only compare docIds because termIds are already in order. > 2. If we take the maxDoc into consideration, we can save 1 round of reorder when maxDoc < (1 << 24). > 3. We may even purely use an offline version of radix sorter to sort the whole file, since all we need is just 3 or 4 times reorder based on point 1 and 2. Some thoughts / todos: * I have not finished the performance benchmark. * The radix sorter can not take advantage of `ForkJoinPool` by now. * This offline radix sorter is a bit different as i can not write to random address in a file. I have to play some trick here if a do not want to create 256 tmp files... -- 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]
