We found FAIR algorithm proposed in FAST'18 has a problem in handling node splits to be concurrent and crash-recoverable. Original FAIR algorithm can make an incorrect tree structure due to internal node split and key deletion. Please refer to our pull request for more detail ( #4 ).
We found FAIR algorithm proposed in FAST'18 has a problem in handling node splits to be concurrent and crash-recoverable. Original FAIR algorithm can make an incorrect tree structure due to internal node split and key deletion. Please refer to our pull request for more detail ( #4 ).