|
|
About
TODO
Blog
RSS
Old blog
Projects
Gallery
Notes
Wed, 28 Nov 2007
20 hours.
Yesterday I woke up at about 6 o'clock and went back to bad (hammock)
today about 2 o'clock. This resulted in properly working (although
lack of tricky interesting features) search/insert operations of the given
btree. It looks a bit different than usual btree (or b+, b# or b-whatever),
right now it supports 64bit keys, but I plan to extend it to 128 bits.
So far I only tested it with usual memory and thus it was a bit limited,
I will run rb-tree vs. btree benchmark for on-disk and in-memory allocations
for milliards of keys.
Stay tuned.
/devel/fs :: Link / Comments (0)
Please solve this captcha to be allowed to post (need to reload in a minute): 57 - 16
|