[jira] [Commented] (LUCENE-10196) Improve IntroSorter with 3-ways partitioning

["ASF subversion and git services (Jira)" <ji...@apache.org>]

    [ https://issues.apache.org/jira/browse/LUCENE-10196?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=17436728#comment-17436728 ] 

ASF subversion and git services commented on LUCENE-10196:
----------------------------------------------------------

Commit 63b9e603e6f53dae40ece03814a9aa613f6cc189 in lucene's branch refs/heads/main from Bruno Roustant
[ https://gitbox.apache.org/repos/asf?p=lucene.git;h=63b9e60 ]

LUCENE-10196: Improve IntroSorter with 3-ways partitioning.


> Improve IntroSorter with 3-ways partitioning
> --------------------------------------------
>
>                 Key: LUCENE-10196
>                 URL: https://issues.apache.org/jira/browse/LUCENE-10196
>             Project: Lucene - Core
>          Issue Type: Improvement
>            Reporter: Bruno Roustant
>            Priority: Major
>          Time Spent: 2h
>  Remaining Estimate: 0h
>
> I added a SorterBenchmark to evaluate the performance of the various Sorter implementations depending on the strategies defined in BaseSortTestCase (random, random-low-cardinality, ascending, descending, etc).
> By changing the implementation of the IntroSorter to use a 3-ways partitioning, we can gain a significant performance improvement when sorting low-cardinality lists, and with additional changes we can also improve the performance for all the strategies.
> Proposed changes:
>  - Sort small ranges with insertion sort (instead of binary sort).
>  - Select the quick sort pivot with medians.
>  - Partition with the fast Bentley-McIlroy 3-ways partitioning algorithm.
>  - Replace the tail recursion by a loop.



--
This message was sent by Atlassian Jira
(v8.3.4#803005)

---------------------------------------------------------------------
To unsubscribe, e-mail: issues-unsubscribe@lucene.apache.org
For additional commands, e-mail: issues-help@lucene.apache.org