Make radix store nodes adaptive to improve memory efficiency

XMLWordPrintableJSON

    • Fully Compatible
    • Execution Team 2020-07-27, Execution Team 2020-08-10, Execution Team 2020-08-24
    • None
    • 3
    • None
    • None
    • None
    • None
    • None
    • None
    • None

      Currently, each node in the tree, including leaf pointers, has 256 shared pointers. Each shared pointer is 16 bytes, for a total of 4kB for the pointers. As the first allocation size > 4kB is 6 kB, and each document results in 2 nodes (one for the index, one for record store), each document has 12kB overhead (18 kB for replica sets due to the oplog).
      This causes each Node to be > 4kB resulting in excessive memory usage during testing and OOMs.

      https://db.in.tum.de/~leis/papers/ART.pdf

              Assignee:
              Yuhong Zhang
              Reporter:
              Audrey Fang (Inactive)
              Votes:
              0 Vote for this issue
              Watchers:
              5 Start watching this issue

                Created:
                Updated:
                Resolved: