[
https://issues.apache.org/jira/browse/LUCENE-6668?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14634785#comment-14634785
]
ASF subversion and git services commented on LUCENE-6668:
---------------------------------------------------------
Commit 1692069 from [~jpountz] in branch 'dev/branches/branch_5x'
[ https://svn.apache.org/r1692069 ]
LUCENE-6668: Add missing Iterator.remove() implementation.
> Optimize SortedSet/SortedNumeric storage for the few unique sets use-case
> -------------------------------------------------------------------------
>
> Key: LUCENE-6668
> URL: https://issues.apache.org/jira/browse/LUCENE-6668
> Project: Lucene - Core
> Issue Type: Improvement
> Reporter: Adrien Grand
> Assignee: Adrien Grand
> Priority: Minor
> Attachments: LUCENE-6668.patch, LUCENE-6668.patch
>
>
> Robert suggested this idea: if there are few unique sets of values, we could
> build a lookup table and then map each doc to an ord in this table, just like
> we already do for table compression for numerics.
> I think this is especially compelling given that SortedSet/SortedNumeric are
> our two only doc values types that use O(maxDoc) memory because of the
> offsets map. When this new strategy is used, memory usage could be bounded to
> a constant.
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
---------------------------------------------------------------------
To unsubscribe, e-mail: dev-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org
