[LUCENE-2575] Concurrent byte and int block implementations

• Type: Improvement
• Status: Open
• Priority: Major
• Resolution: Unresolved
• Affects Version/s: Realtime Branch
• Fix Version/s: 6.0
• Component/s: core/index
• Lucene Fields: New
• Assignee: Unassigned
• Reporter: Jason Rutherglen
• Created: 29/Jul/10 05:04
• Updated: 28/Aug/22 12:30

Description

The current *BlockPool implementations aren't quite concurrent.
We really need something that has a locking flush method, where
flush is called at the end of adding a document. Once flushed,
the newly written data would be available to all other reading
threads (ie, postings etc). I'm not sure I understand the slices
concept, it seems like it'd be easier to implement a seekable
random access file like API. One'd seek to a given position,
then read or write from there. The underlying management of byte
arrays could then be hidden?

Issue Links

• blocks: LUCENE-2567 RT Terms Dictionary
• is part of: LUCENE-2312 Search on IndexWriter's RAM Buffer