# Dynamic Sized Non-blocking Hash tables

**URL:** <https://discuss.dgraph.io/t/dynamic-sized-non-blocking-hash-tables/664>\
**Category:** Misc\
**Created:** [August 9, 2016, 12:55am UTC](https://discuss.dgraph.io/t/dynamic-sized-non-blocking-hash-tables/664 "2016-08-09T00:55:16Z")\
**Posts on this page:** 1\
**Page:** 1

<div class="post-metadata">

**Author:** ![mrjn](https://yyz1.discourse-cdn.com/flex007/user_avatar/discuss.dgraph.io/mrjn/32/775_2.png) [@mrjn](https://discuss.dgraph.io/u/mrjn)\
**Post date:** [August 9, 2016, 12:55am UTC](https://discuss.dgraph.io/t/dynamic-sized-non-blocking-hash-tables/664/1 "2016-08-09T00:55:16Z")

</div>

Hey @minions,

@Wei found this paper when looking at gotomic hashmap and atomic maps in general. [http://yujieliu.me/write/2014.podc.pdf](http://yujieliu.me/write/2014.podc.pdf)

This paper claims faster performance than [the paper gotomic is based on](https://github.com/zond/gotomic).

Seems like a very interesting read, definitely recommended!

Thanks!

Cheers,  
Manish