News for hackers. Stuff that matters.
Re:Writing a Very Fast Hash Table with Tiny Memory Footprints by dryman on Monday May 08, 2017 @11:55PM (#14297628)
Thanks for the reference. I'm collecting a list of embedded key-value store to benchmark against. I'll tryout with this one first!
Re:Writing a Very Fast Hash Table with Tiny Memory Footprints by corysama on Tuesday May 09, 2017 @01:15AM (#14297885)
Fun note: Because of this line in the article

> Because MDBM gives you raw pointers into the DB’s data, you have to be very careful about making sure you don’t have array over-runs, invalid pointer access, or the like.

Someone wrote a Rust binding http://erickt.github.io/blog/2014/12/13/rust-and-mdbm/

Re:Writing a Very Fast Hash Table with Tiny Memory Footprints by dryman on Tuesday May 09, 2017 @01:41AM (#14297959)
Wow that's a very interesting post! Maybe I should try to bring a rust binding to my project as well..
Re:Writing a Very Fast Hash Table with Tiny Memory Footprints by posnet on Tuesday May 09, 2017 @03:35AM (#14298334)
Re:Writing a Very Fast Hash Table with Tiny Memory Footprints by dom0 on Tuesday May 09, 2017 @09:20AM (#14299735)
LMDB
Re:Writing a Very Fast Hash Table with Tiny Memory Footprints by hyc_symas on Sunday May 14, 2017 @09:40PM (#14338545)
I would expect this hash table to be much faster than LMDB for tables that fit in RAM. It doesn't have transactions or any kind of concurrent access guarantees so naturally it has lower access overhead. For data sets larger than RAM, or in multithreaded environments, it will be pretty unusable.