Back
Performance Benchmark
High-Tree vs Standard Recursive DOM
Dataset size
1,000 nodes
5,000 nodes
10,000 nodes
20,000 nodes
50,000 nodes ⚠ Standard may lag
100,000 nodes ⚠ Standard will crash
Run Benchmark
Standard Tree
Idle
Initial Load
—
DOM Nodes
—
Run benchmark to load
High-Tree (Virtual)
Idle
Initial Load
—
DOM Nodes
—
Run benchmark to load
Interactive Performance
Expand All
Run
Standard
—
High-Tree
—
Search Filter
Go
Standard
—
High-Tree
—
Bulk Check (Cascade)
Run
Standard
—
High-Tree
—
Why is High-Tree faster?
DOM Virtualization
Only renders the nodes visible in the viewport. Standard trees render every node upfront.
Flat State Architecture
Uses a flat array for rendering, avoiding expensive recursive DOM traversals.
Web Worker Offloading
Tree flattening and cascade selection run in a background thread, keeping the UI free.
Differential Rendering
Re-renders only rows whose state has changed, not the entire visible window.