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
As far as I can tell, deletions are handled by writing a new Node at the old path with no Stat. children for this Node should have all references to the old entry deleted at all hierarchy levels. The new index (aka, the deletion version) should be included as the most recent entry at all currently non-empty directory levels (aka, deleting a single deeply nested file results in a shorter children list than previously).
There is another level of complexity: deleted nodes (aka, empty nodes or "tombstones") can be be garbage collected on any write to the register. This is tricky/hard! Will probably be removed in hyperdb, or left as an optional optimization.
From experimentation, it looks like deletes are encoded by adding a
Node
entry with noStat
... but with updatedchildren
?If somebody replies to this issue I can submit a PR updating the paper.
The text was updated successfully, but these errors were encountered: