6 ms·
I talked a bit about some of the advantages in this pretty old blog post: https://www.singlestore.com/blog/what-is-skiplist-why-skiplist-index-for-memsql/ https
by AdamProut 4y ago
I talked a bit about some of the advantages in this pretty old blog post:
https://www.singlestore.com/blog/what-is-skiplist-why-skiplist-index-for-memsql/ https://www.singlestore.com/blog/what-is-skiplist-why-skipli...
Simplicity is really the biggest advantage. Being simple, its much easier to implement a skiplist lock free vs other data structures. This helps it perform really well under highly concurrent point read and write workloads.
Its not as good at scans, but if you really care about scan performance you should be using a columnstore layout (and not a tree).
- mbfg 4y agois the max tower height really just randomly determined, or is it fixed, or sized based on the total # of entries?
- kccqzy 4y agoIf we are going as far as using a source of randomness in our data structures, I think treaps are conceptually just as simple if not simpler, and I think is also easier to implement than skip lists.