Uploaded image for project: 'Core Server'
  1. Core Server
  2. SERVER-100877

Improve the algorithm of finding an open bucket for time-series inserts

    • Type: Icon: Improvement Improvement
    • Resolution: Fixed
    • Priority: Icon: Major - P3 Major - P3
    • 8.2.0-rc0
    • Affects Version/s: None
    • Component/s: None
    • None
    • Storage Execution
    • Fully Compatible
    • Storage Execution 2025-04-14, Storage Execution 2025-04-28
    • None
    • None
    • None
    • None
    • None
    • None
    • None

      We currently prioritize kSoftClose/kArchive buckets over the kNone bucket and return them in a vector in such order.

      We can further improve it with prioritizing kSoftClose candidates over kArchive, since we can easily reopen the kArchive ones whereas we're about to forget about kSoftClose (ignoring query-based reopening), so this is our last chance to fill them up. We could also prioritize buckets with less data in them, to improve fill ratios, etc.

            Assignee:
            stephanie.eristoff@mongodb.com Stephanie Eristoff
            Reporter:
            yuhong.zhang@mongodb.com Yuhong Zhang
            Votes:
            0 Vote for this issue
            Watchers:
            4 Start watching this issue

              Created:
              Updated:
              Resolved: