3 ms·
Did you consider fractal trees? http://tokutek.com/presentations/bender-Scalperf-9-09.pdf http://tokutek.com/presentations/bender-Scalperf-9-09.pdf
by lisper 16y ago
Did you consider fractal trees?
http://tokutek.com/presentations/bender-Scalperf-9-09.pdf http://tokutek.com/presentations/bender-Scalperf-9-09.pdf
- psaccounts 16y agoIs there a more useful technical paper on Fractal Trees? Better yet is there a open source implementation of the same?
- jbapple 16y agoCache-oblivious streaming B-trees: http://supertech.csail.mit.edu/papers/sbtree.pdf http://supertech.csail.mit.edu/papers/sbtree.pdf I don't know for certain any open-source implementation, but I have heard COLAs are used in HBase.
- yingfeng 16y agofractal trees should have a faster read performance with leveldb with a comparable updating performance. There does not exist any open source solution for such structure, while we could hope that www.acunu.com might provide an open source solution for similary Stratified B-tree http://www.acunu.com/2011/04/log-file-systems-and-ssds-made-for-each-other/ http://www.acunu.com/2011/04/log-file-systems-and-ssds-made-...
- br1 16y agoBeing in-kernel, acunu is very far from the lightness of LevelDB.