I want to know the mechanism of dml(insert, delete, update, upsert) when using the ‘lockfree skiplist’ index of low store.
A similar mechanism to b-tree was seen in the document.
Is the b-tree index identical to mechanism of dml?
What type of information are you looking for? We have an overview of the skiplist indexing here: