[jira] [Commented] (LUCENE-8687) Optimise radix partitioning for points on heap

classic Classic list List threaded Threaded
1 message Options
Reply | Threaded
Open this post in threaded view

[jira] [Commented] (LUCENE-8687) Optimise radix partitioning for points on heap

Tim Allison (Jira)

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

ASF subversion and git services commented on LUCENE-8687:

Commit 9db39ab0ca09d7eeece4c4bc055f7591eb789a00 in lucene-solr's branch refs/heads/master from Ignacio Vera
[ https://gitbox.apache.org/repos/asf?p=lucene-solr.git;h=9db39ab ]

LUCENE-8687: Optimise radix partitioning for points on heap

> Optimise radix partitioning for points on heap
> ----------------------------------------------
>                 Key: LUCENE-8687
>                 URL: https://issues.apache.org/jira/browse/LUCENE-8687
>             Project: Lucene - Core
>          Issue Type: Improvement
>            Reporter: Ignacio Vera
>            Priority: Major
>          Time Spent: 1.5h
>  Remaining Estimate: 0h
> In LUCENE-8673 it was introduced radix partitioning for merging segments. It currently works the same when you have data offline and on-heap. It makes sense when data is on-heap, not to have multiple copies but perform the partitioning always in the same object, similar to what it is done with `MutablePointValues`.
> This will allow to hold more points in memory as well because we don't have multiple copies of the same data as we recurse.

This message was sent by Atlassian JIRA

To unsubscribe, e-mail: [hidden email]
For additional commands, e-mail: [hidden email]