diff options
| author | IkiWiki <ikiwiki.info> | 2021-05-22 23:47:15 -0700 |
|---|---|---|
| committer | IkiWiki <ikiwiki.info> | 2021-05-22 23:47:15 -0700 |
| commit | 34d001d0e23551c8550b0e2b62734cbe68d1caa2 (patch) | |
| tree | 05dc385148c870a7445ac5ec0da108fb463253e8 /Roadmap.mdwn | |
| parent | 42351b958ad21a487369e6adc27eb95f74a40e44 (diff) | |
| parent | d1386efe8b64c2fb1e6a269824ead10f01f785f3 (diff) | |
Merge branch 'master' of /home/bcachefs/bcachefs
Diffstat (limited to 'Roadmap.mdwn')
| -rw-r--r-- | Roadmap.mdwn | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/Roadmap.mdwn b/Roadmap.mdwn index 8cba90b..f00442d 100644 --- a/Roadmap.mdwn +++ b/Roadmap.mdwn @@ -111,7 +111,7 @@ index an entire SSD worth of blocks, and for persistent data structures btrees have a number of advantages over hash tables (can do extents, and when access patterns have locality they preserve that locality). Using singleton btrees is a major simplification when writing a filesystem, but it does mean that -everything is leaving rather heavily on the performance and scalability of the +everything is leaning rather heavily on the performance and scalability of the btree implementation. Bcachefs b-trees are a hybrid compacting data structure - they share some |