Uploaded image for project: 'Lucene - Core'
  1. Lucene - Core
  2. LUCENE-2575

Concurrent byte and int block implementations

Attach filesAttach ScreenshotAdd voteVotersWatch issueWatchersCreate sub-taskLinkCloneUpdate Comment AuthorReplace String in CommentUpdate Comment VisibilityDelete Comments
    XMLWordPrintableJSON

Details

    • Improvement
    • Status: Open
    • Major
    • Resolution: Unresolved
    • Realtime Branch
    • 6.0
    • core/index
    • None
    • New

    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?

      Attachments

        1. LUCENE-2575.patch
          30 kB
          Jason Rutherglen
        2. LUCENE-2575.patch
          30 kB
          Jason Rutherglen
        3. LUCENE-2575.patch
          92 kB
          Jason Rutherglen
        4. LUCENE-2575.patch
          99 kB
          Jason Rutherglen
        5. LUCENE-2575.patch
          5 kB
          Jason Rutherglen
        6. LUCENE-2575.patch
          6 kB
          Jason Rutherglen
        7. LUCENE-2575.patch
          5 kB
          Jason Rutherglen
        8. LUCENE-2575.patch
          5 kB
          Jason Rutherglen

        Issue Links

        Activity

          This comment will be Viewable by All Users Viewable by All Users
          Cancel

          People

            Unassigned Unassigned
            jasonrutherglen Jason Rutherglen

            Dates

              Created:
              Updated:

              Slack

                Issue deployment