search

thesecretmaster / predis-v0

Like redis, but parallel and written from scratch for fun!
GNU General Public License v3.0
1 stars 0 forks source link

Using binary search trees for the ends of the hashtable instead of linked lists #30

Open thesecretmaster opened 4 years ago

thesecretmaster commented 4 years ago

In the collision case in the hash table, currently we traverse a linked list. To have better performance characteristics with a minimal memory overhead, we could make it a tree instead. Let's do that!

thesecretmaster commented 4 years ago

The only reason I'm not tagging this as a good first issue is because you'd need to write a lock free binary tree that has the right performance characteristics, and that's a decent bit of work for someone who isn't familiar with lock free data structures.