4 ms·
I had to opportunity to look at the code. I believe this should be compared against embedded hash database such as "kyoto cabinet, LevelDB, RocksDB" . They int
by skyde 8y ago
I had to opportunity to look at the code.
I believe this should be compared against embedded hash database such as "kyoto cabinet, LevelDB, RocksDB" .
They introduce a novel latch free hashtable that they say is faster than other in memory data structure.
They also introduce a new disk persistence system called HybridLog that combines in-place updates
(in memory) and log-structured organization (on disk).
The interesting aspect of the HybridLog is that it act as a bufferpool but seem to work at the record level instead of working with pages like a B-tree buffer pool would or compressed block as levelDB block_cache does.
- captain_crabs 8y agoAlthough I never got a CS degree, because I kind of understood this comment, I guess I can officially consider myself a nerd now.
- brongondwana 8y agoI was very surprised to see pretty much the entire implementation inside a file called faster.h rather than in a .cc file. Maybe that's all the rage in C++ libraries, I don't work with many of them.
- utoku 8y agoIt is because of the template class code. In C++, a template is not really a class or a function. https://isocpp.org/wiki/faq/templates#templates-defn-vs-decl https://isocpp.org/wiki/faq/templates#templates-defn-vs-decl
- fahrradflucht 8y agoTo compare it to rocksdb or leveldb: it looks like there is no iteration support or the notion of ordered keys to support partial scans...