5 ms·
‘It depends’ - don’t forget about locking overhead, needing to flush multiple pages/leafs as thresholds get hit, disk I/O wait times, etc. At the beginning it’
by lazide 3y ago
‘It depends’ - don’t forget about locking overhead, needing to flush multiple pages/leafs as thresholds get hit, disk I/O wait times, etc.
At the beginning it’s rarely noticeable, but it does exist and under heavy load or with a lot of index writes needing to happen it can cause very noticeable overhead.
- vjerancrnjak 3y agoYes, but these bits don’t scale with log(n) index tree. They depend on something other than the index data structure.
- lazide 3y agoUsually load.