Inserts/deletes
Inserts: conventional R*-tree algo without forced reinserts
Deletes: tree nodes are only deleted during a reorganize operation
Insert/delete:
- Locate leaf node to be updated (no locking)
- Modify leaf node and propagate update up the tree (locks the node for the transaction)