Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

[BUG FIX] FAIR algorithm #4

Open
wants to merge 4 commits into
base: master
Choose a base branch
from
Open

[BUG FIX] FAIR algorithm #4

wants to merge 4 commits into from

Commits on Feb 28, 2019

  1. [BUG FIX] The bug of FAIR algorithm is fixed. 

    Current additional implementation for fixing FAIR bug is only reflected
to insertion and search operations. Please change other code sections
for other operations, such as remove and scan.
    @SeKwonLee
    SeKwonLee committed Feb 28, 2019
    Configuration menu
    Copy the full SHA
    faca189 View commit details
    Browse the repository at this point in the history

Commits on Mar 14, 2019

  1. Fixing FAIR algorithm bug of leaf node split 

    Solution: Adding middle key to new right sibling node
    @SeKwonLee
    SeKwonLee committed Mar 14, 2019
    Configuration menu
    Copy the full SHA
    a5def6c View commit details
    Browse the repository at this point in the history

  2. Adding new test code to run without input file

    @SeKwonLee
    SeKwonLee committed Mar 14, 2019
    Configuration menu
    Copy the full SHA
    fe79323 View commit details
    Browse the repository at this point in the history

  3. [BUG FIX] FAIR algorithm of leafnode split 

    Adding high key to every split leaf node
    @SeKwonLee
    SeKwonLee committed Mar 14, 2019
    Configuration menu
    Copy the full SHA
    db74fa8 View commit details
    Browse the repository at this point in the history