[
https://issues.apache.org/jira/browse/LUCENE-5416?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13889572#comment-13889572
]
Michael McCandless commented on LUCENE-5416:
--------------------------------------------
bq. Would it be correct to conclude from that and from the measurements here
that faceting involves nextDoc() on high bit densities?
Yes, this is typically the "hardest" case for faceting, so if we have some
ideas on how to make that iteration faster, that would be great. But I can't
tell here what the idea is? Can we somehow separate it out from the
DocBlockIterator?
> Performance of a FixedBitSet variant that uses Long.numberOfTrailingZeros()
> ---------------------------------------------------------------------------
>
> Key: LUCENE-5416
> URL: https://issues.apache.org/jira/browse/LUCENE-5416
> Project: Lucene - Core
> Issue Type: Bug
> Components: core/search
> Affects Versions: 5.0
> Reporter: Paul Elschot
> Priority: Minor
> Fix For: 5.0
>
>
> On my machine the current byte index used in OpenBitSetIterator is slower
> than Long.numberOfTrailingZeros() for advance().
> The pull request contains the code for benchmarking this taken from an early
> stage of DocBlocksIterator.
> In case the benchmark shows improvements on more machines, well, we know what
> to do...
--
This message was sent by Atlassian JIRA
(v6.1.5#6160)
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
