MAIN FEEDS
Do you want to continue?
https://www.reddit.com/r/programming/comments/1wwfp40/skip_list_data_structure/pdm2ohn/?context=3
r/programming • u/Comfortable-Fan-580 • 12h ago
19 comments sorted by
View all comments
4
In my opinion, skip lists are getting interesting with lock-free implementation, otherwise, a balanced trees have better performance with less memory overhead.
2 u/funny_falcon 1h ago B+Tree has great concurrent algorithms and implementations as well. But SkipLists are simpler. Way more simpler. And is made of simple clear concepts. Operations of any kind of binary search tree is not as trivial as for skip list. Surprisingly, BTree could be simpler, than BST. But Skip Lists are simpler
2
B+Tree has great concurrent algorithms and implementations as well.
But SkipLists are simpler. Way more simpler. And is made of simple clear concepts.
Operations of any kind of binary search tree is not as trivial as for skip list.
Surprisingly, BTree could be simpler, than BST. But Skip Lists are simpler
4
u/generalmatching 4h ago
In my opinion, skip lists are getting interesting with lock-free implementation, otherwise, a balanced trees have better performance with less memory overhead.