rishabhmaurya opened a new pull request, #13186: URL: https://github.com/apache/lucene/pull/13186
### Description As described in the paper (Tradeoff Options for Bipartite Graph Partitioning), simulated annealing-type mechanism be employed to reduce number of swaps with each iteration. If projected advantage swapping 2 docs across partitions isn't as appealing, in this case less than `iter` bits, then swap can be avoided. Swapping documents is a heavy operation as it requires recomputing biases for documents which are affected by the swap i.e. have common terms with other documents in the partition. Currently, its only employed once before starting the shuffle operation, where we check against the max gain possible for a given iteration and if its at least `iter` bits apart. This condition can be checked with each swap when performing quick select, if its worthy. <!-- If this is your first contribution to Lucene, please make sure you have reviewed the contribution guide. https://github.com/apache/lucene/blob/main/CONTRIBUTING.md --> -- 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
