You are viewing a plain text version of this content. The canonical link for it is here.
Posted to dev@lucene.apache.org by "Ignacio Vera (JIRA)" <ji...@apache.org> on 2019/02/11 07:15:00 UTC
[jira] [Resolved] (LUCENE-8687) Optimise radix partitioning for
points on heap
[ https://issues.apache.org/jira/browse/LUCENE-8687?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]
Ignacio Vera resolved LUCENE-8687.
----------------------------------
Resolution: Fixed
Assignee: Ignacio Vera
Fix Version/s: 8.x
master (9.0)
> 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
> Assignee: Ignacio Vera
> Priority: Major
> Fix For: master (9.0), 8.x
>
> 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
(v7.6.3#76005)
---------------------------------------------------------------------
To unsubscribe, e-mail: dev-unsubscribe@lucene.apache.org
For additional commands, e-mail: dev-help@lucene.apache.org