In-memory hash tree implementation

Re:In-memory hash tree implementation by hit9 on Sunday March 27, 2016 @10:39AM (#11370073)

For this case, conflicts can be solved via the traditional separate chaining strategy, to open a list on the Item.

This htree was originally implemented as the indexing container to store key-value poisition informations for the bitcask storage engine. And string keys are not stored in the htree to save more memory. Collisions of two string keys are distinguished by checking the disk.

[ Parent | on HN ]

Re:In-memory hash tree implementation by hit9 on Sunday March 27, 2016 @11:11AM (#11370188)

And the origin string keys are stored in the htree item only if there is collision. So the string key distinguishing checks are at most once.

[ Parent | on HN ]