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
During the Arbo refactor performed on this PR #1080 I realized of two potential optimizations that could be made to increase speed on Add/Delete and Update methods.
Instead of removing the intermediate orphan nodes SYNC (after the up() operation), it could be done ASYNC. The only thing we need to care about is to find a mechanism that can recover the list of nodes to remove after a program forced stop.
When deleting recursively calling deleteWithTx() the orphan nodes (to later on add them again in the correct place). Instead of starting from the current Root we could execute the delete on a subtree, where the root is the current neighbour node.
The text was updated successfully, but these errors were encountered:
During the Arbo refactor performed on this PR #1080 I realized of two potential optimizations that could be made to increase speed on Add/Delete and Update methods.
Instead of removing the intermediate orphan nodes SYNC (after the
up()
operation), it could be done ASYNC. The only thing we need to care about is to find a mechanism that can recover the list of nodes to remove after a program forced stop.When deleting recursively calling
deleteWithTx()
the orphan nodes (to later on add them again in the correct place). Instead of starting from the currentRoot
we could execute the delete on a subtree, where the root is the current neighbour node.The text was updated successfully, but these errors were encountered: