Data structureadvanced
B^ε-tree
Also called B-epsilon tree, fractal tree index, buffered B-tree.
Write-optimized tree that buffers updates in internal nodes and flushes them in batches.
Write-optimized tree that buffers updates in internal nodes and flushes them in batches.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag NA7JW5 Edit this page History Report an error