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(
相關文章
相關標籤/搜索