...
- Delete performance is linear on the amount of data being deleted (as expected).
- Raw performance of deleting containers of list elements container nodes is around 40,000 fragments per second. (So we can delete data nodes around 10x faster than creating them.)
- Deleting lists is much slower than deleting the parent container of the list (which can be easily improved).
- Of note, attempting to delete non-existing data nodes takes longer than actually deleting the equivalent amount of nodes with descendants - it is a slow operation.
...