[
https://issues.apache.org/jira/browse/LUCENE-5610?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Michael McCandless updated LUCENE-5610:
---------------------------------------
Attachment: LUCENE-5610.patch
New possible patch. I switched to using BigInteger to compute the
midpoint ... but some tests are very slow, e.g.:
ot TestDirectoryTaxonomyWriter.testHugeLabel -seed B50345AE17F7D036
It's a long shot ... but maybe we could index the "exact" trie terms
in a separate field than their precShifts? Then we could just take
max of the "exact trie terms" field ... that's a big change though :)
> Add Terms min/max
> ------------------
>
> Key: LUCENE-5610
> URL: https://issues.apache.org/jira/browse/LUCENE-5610
> Project: Lucene - Core
> Issue Type: Improvement
> Reporter: Robert Muir
> Attachments: LUCENE-5610.patch, LUCENE-5610.patch
>
>
> Having upper/lower bounds on terms could be useful for various optimizations
> in the future, e.g. to accelerate sorting (if a segment can't compete, don't
> even search it), and so on.
> Its pretty obvious how to get the smallest term, but the maximum term for a
> field is tricky, but worst case you can do it in ~ log(N) time by binary
> searching term space.
--
This message was sent by Atlassian JIRA
(v6.2#6252)
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
