|
|
|
|
|
|
by thomastay
1777 days ago
|
|
|
Hey, I'm really curious about how that works. Could you go into a bit more detail into that? From what I can gather on your comment, it seems that if you are given a splay tree, and a batch of transactions i.e. GET 1
SET 10 "hello"
GET 15
You would write all the visited nodes, in order? But splaying involves a lot of tree operations and rotations too. I don't get how that works. |
|
|
Correct, but the whole idea is that over time the same subset of hot nodes is going to trickle to the top of the tree, so you are just rewriting node offsets in your temporary list as you process the batch. A node may be logically modified 100x per batch, and only written to storage once.