Uploaded image for project: 'WiredTiger'
  1. WiredTiger
  2. WT-11653

Investigate sharing tree search code between cursor search and append

    • Type: Icon: Task Task
    • Resolution: Unresolved
    • Priority: Icon: Minor - P4 Minor - P4
    • None
    • Affects Version/s: None
    • Component/s: None
    • StorEng - Refinement Pipeline
    • None

      This is fallout from WT-11525. During the code review, haribabu.kommi@mongodb.com pointed out that the bug would not have happened if the append and search code used the same approach when walking the tree.

      Currently, append calls tree_walk while search uses a bespoke binary search on record numbers.

      This ticket is to choose between two approaches - either having search do a tree walk, or having append reuse the search code. This latter approach would require a refactor. Neither of these approaches being realistic is also an acceptable outcome, but there should be good reasons.

            Assignee:
            backlog-server-storage-engines [DO NOT USE] Backlog - Storage Engines Team
            Reporter:
            will.korteland@mongodb.com Will Korteland
            Votes:
            0 Vote for this issue
            Watchers:
            1 Start watching this issue

              Created:
              Updated: