Explain the meaning of upperbound and lowerbound in disk-oriented DBMS

Children in each B+ Tree's node has upperbound and lowerbound.node Explain the meaning of upperbound and lowerbound in disk-oriented DBMS.ide   upper_bound(i) 返回的是键值为i的元素能够插入的最后一个位置(上界)get lowe_bound(
相关文章
相关标签/搜索