Skip to content

Distributed searching

Jump to bottom
Oleh Shklyar edited this page Aug 11, 2021 · 1 revision

Freenet: Distributed searching, B Tree index (infinity0's Summer of Code 2009 work), Library, Spider

Planned optimizations

  • Making it a b+tree rather than a b-tree so that all the data is in the leaves. This is probably a good idea for various reasons. It would also be useful to look at the paper on COW B-Trees cited in the wikipedia article on BTRFS.

Clone this wiki locally