News for hackers. Stuff that matters.

A comment on LevelDB: a fast and lightweight key/value database library. Parent comment

Re:LevelDB: a fast and lightweight key/value database library by lisper on Sunday May 08, 2011 @03:19PM (#2526527)
Did you consider fractal trees?

http://tokutek.com/presentations/bender-Scalperf-9-09.pdf

[ Parent | on HN ]
Re:LevelDB: a fast and lightweight key/value database library by yingfeng on Monday May 09, 2011 @12:03AM (#2527515)
fractal 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-...
[ Parent | on HN ]
Re:LevelDB: a fast and lightweight key/value database library by br1 on Monday May 09, 2011 @10:47AM (#2528861)
Being in-kernel, acunu is very far from the lightness of LevelDB.
[ Parent | on HN ]
Re:LevelDB: a fast and lightweight key/value database library by psaccounts on Sunday May 08, 2011 @04:34PM (#2526670)
Is there a more useful technical paper on Fractal Trees? Better yet is there a open source implementation of the same?
[ Parent | on HN ]
Re:LevelDB: a fast and lightweight key/value database library by jbapple on Sunday May 08, 2011 @10:44PM (#2527346)
Cache-oblivious streaming B-trees:

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.

[ Parent | on HN ]