Concurrency for R-tree updates
Implemented in 2 phases (as in Conc. GiST)
Locate phase: identify leaf node to be updated using reads
Update phase: update leaf node and propagate up the tree
- Locking: node-level (for txn duration)
- Concurrent updates on same node: serialized
- Tracing node-splits: node_id, sibling pointer
- Tracing root splits (height increase): root_rowid, root_id