Re: JFFS3 superblock search

Artem B. Bityuckiy
2005-06-06T13:46:15Z

Jörn Engel wrote:
> You already know that I'm skeptical about the B+ tree. But I'm even
> more skeptical about a 4-level tree. That could turn into a
> bottleneck rather quickly.
>
Joern,

providing the key is 16 bytes and the pointer is 8 bytes, the 4-level
B-tree is enough for (4096/24)^4 = 170^4 ~1E8. If this isn't enough we
may use more levels as well.

--
Best Regards,
Artem B. Bityuckiy,
St.-Petersburg, Russia.