FYI, I posted a fully working version of this several months ago - it
uses the natural segment boundaries to break a filter into multiple
filters for caching.
On Feb 12, 2007, at 5:39 PM, Mark Harwood (JIRA) wrote:
Factory for RangeFilters that caches sections of ranges to reduce
disk reads
----------------------------------------------------------------------
------
Key: LUCENE-798
URL: https://issues.apache.org/jira/browse/LUCENE-798
Project: Lucene - Java
Issue Type: New Feature
Components: Search
Reporter: Mark Harwood
RangeFilters can be cached using CachingWrapperFilter but are only
re-used if a user happens to use *exactly* the same upper/lower
bounds.
This class demonstrates a caching approach where *sections* of
ranges are cached as bitsets and these are re-used/combined to
construct large range filters if they fall within the required
range. This can improve the "cache hit" ratio and avoid going to
disk to read large lists of Doc ids from TermDocs.
This class needs some more work to add thread safety but I'm making
it available to gather feedback on the design at this early stage
before making robust.
--
This message is automatically generated by JIRA.
-
You can reply to this email to add a comment to the issue online.
---------------------------------------------------------------------
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
---------------------------------------------------------------------
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]