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
It requires to store tombstones in index, to prevent insertion of deleted entitiies
The main advantage of this approach is that it doesn't require mutable forward trx graph index.
Also backward indexation may use immutable information from merge nodes about merged branches base.
On other hand current "backward" indexation, actually traverses a graph in backward direction and builts subgraph to index, and then traverses that graph in forward direction.
Consider switch to forward indexation direction. Especially, if #112 with append will be implemented.
The text was updated successfully, but these errors were encountered:
Currently qbit performs initial wal indexation in backwards order (from leaf to root). But this approach has several disadvantages:
The main advantage of this approach is that it doesn't require mutable forward trx graph index.
Also backward indexation may use immutable information from merge nodes about merged branches base.
On other hand current "backward" indexation, actually traverses a graph in backward direction and builts subgraph to index, and then traverses that graph in forward direction.
Consider switch to forward indexation direction. Especially, if #112 with append will be implemented.
The text was updated successfully, but these errors were encountered: