...
| Total device nodes | 500 | 1,000 | 1,500 | 2,000 | 2,500 | 3,000 |
|---|---|---|---|---|---|---|
| Fragments read | 43,000 | 86,000 | 129,000 | 172,000 | 215,000 | 258,000 |
| Time (seconds) | 0.61 | 1.15 | 1.52 | 2.14 | 2.96 | 3.97 |
Special case: attempting to read multiple non-existing data nodes
In this case, we attempt to read many non-existing data nodes:
...
The above case appears to be constant time, but theoretically must be linear - we'll call it negligible time.
Observations
- Reading many data nodes with all descendants has linear time (as expected).Attempting to read many non-existing data nodes takes negligible time.
- Raw performance of reading many with all descendants is roughly 80,000 fragments per second.
...