You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The current C-Tree is inserting elements eagerly. This is bad when the root tree is dense (i.e., it already have many cracks). It no longer "do just enough" as the insert cost will be O(log(N)) instead of O(1).
One way to avoid this cost is to buffer inserts at the root element and push them down as needed.
The text was updated successfully, but these errors were encountered:
The current C-Tree is inserting elements eagerly. This is bad when the root tree is dense (i.e., it already have many cracks). It no longer "do just enough" as the insert cost will be O(log(N)) instead of O(1).
One way to avoid this cost is to buffer inserts at the root element and push them down as needed.
The text was updated successfully, but these errors were encountered: