Fractal Tree
E715759
A Fractal Tree is a write-optimized indexing data structure designed to improve insertion and update performance in databases by buffering and batching operations.
Statements (48)
| Predicate | Object |
|---|---|
| instanceOf |
database index
ⓘ
index data structure ⓘ write-optimized data structure ⓘ |
| hasAdvantageOver | B-tree for high-insert workloads ⓘ |
| hasAlternativeName |
Fractal Tree index
ⓘ
Fractal tree data structure NERFINISHED ⓘ |
| hasApplication |
general-purpose database indexing
ⓘ
log and event data indexing ⓘ time-series data storage ⓘ |
| hasBehavior | propagates buffered messages down the tree ⓘ |
| hasComplexityProperty | asymptotically improved write complexity compared to B-trees in theory ⓘ |
| hasComponent |
internal nodes with buffers
ⓘ
leaf nodes storing records or pointers ⓘ |
| hasDesignGoal |
improve insertion performance
ⓘ
improve update performance ⓘ reduce random disk I/O ⓘ support high write throughput ⓘ |
| hasProperty |
asymptotically faster inserts than B-trees under some workloads
ⓘ
batched operations ⓘ buffered ⓘ write-optimized ⓘ |
| hasResearchArea |
I/O-efficient algorithms
ⓘ
data structures ⓘ database systems ⓘ |
| hasTradeoff |
may use more space than a B-tree in some configurations
ⓘ
slightly more complex implementation than B-tree ⓘ |
| isBasedOn | tree structure ⓘ |
| isComparedTo |
B-tree
NERFINISHED
ⓘ
log-structured merge tree NERFINISHED ⓘ |
| isRelatedTo |
cache-oblivious data structures
ⓘ
external memory algorithms ⓘ write-optimized index ⓘ |
| isRelevantFor |
OLTP workloads
ⓘ
large-scale databases ⓘ write-heavy workloads ⓘ |
| isUsedIn |
database systems
ⓘ
log-structured and write-optimized systems ⓘ storage engines ⓘ |
| optimizesFor |
bulk loading
ⓘ
sequential disk writes ⓘ |
| supportsOperation |
deletion
ⓘ
insertion ⓘ point query ⓘ range query ⓘ update ⓘ |
| usesConcept |
batched updates
ⓘ
buffering ⓘ message passing ⓘ |
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.