I am making a document about the DML mechanism of memsql.
I understood the skiplist mechanism of insert, delete when using low store.
I think the update mechanism is internally delete, and then insert. Is it right?
And the reason I came to think this is because of the memsql document that the skiplist is performed similarly to the B-tree, and I looked at it the same as the update mechanism of the b-tree.
I think the update mechanism adds a flag to the existing data that it has been deleted and inserts new updated data.
The memory of the data that was subsequently flagged for deletion by the garbage collector is turned off.
Then, the data that has been flagged for deletion is turned off by the garbage collector.
Please help me with this.