[
https://issues.apache.org/jira/browse/LUCENE-10120?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=17437012#comment-17437012
]
Greg Miller commented on LUCENE-10120:
--------------------------------------
[~ChrisLu] if I'm understanding this correctly, it sounds like your proposal
here is to add a new special-case to the LRU caching that optimizes for an
extremely dense iterator, where all documents within a given min/max range are
present (and the extreme case of this being where all docs match). Is that a
correct understanding? If so, it could be interesting to try this out. I think
we'd only need to modify the {{cacheIntoBitSet}} method to behave similar to
{{DocsWithFieldSet}} (as you point out). I don't know if we'll see much impact,
but I like the idea!
> Lazy initialize FixedBitSet in LRUQueryCache
> --------------------------------------------
>
> Key: LUCENE-10120
> URL: https://issues.apache.org/jira/browse/LUCENE-10120
> Project: Lucene - Core
> Issue Type: Improvement
> Components: core/search
> Affects Versions: main (9.0)
> Reporter: Lu Xugang
> Priority: Major
> Attachments: 1.png
>
>
> Basing on the implement of collecting docIds in DocsWithFieldSet, may be we
> could do similar way to cache docIdSet in
> *LRUQueryCache#cacheIntoBitSet(BulkScorer scorer, int maxDoc)* when docIdSet
> is density.
> In this way , we do not always init a huge FixedBitSet which sometime is not
> necessary when maxDoc is large
>
>
>
--
This message was sent by Atlassian Jira
(v8.3.4#803005)
---------------------------------------------------------------------
To unsubscribe, e-mail: issues-unsubscr...@lucene.apache.org
For additional commands, e-mail: issues-h...@lucene.apache.org
