The B-link tree was proposed by Lehman and Yao in 1981; by adding a link pointer to the right sibling node and recording a high key at each node, it transforms SMOs into transitional states that can be completed in stages.