3 ms·
So the writes are O(N) then - to keeps reads at O(1)?
by nikhilsimha 2y ago
So the writes are O(N) then - to keeps reads at O(1)?
- ryzhyk 2y agoBoth reads and writes are O(1) in time complexity. Writes additionally have the log(N) amortized cost of maintaining the LSM tree.
- nikhilsimha 2y agogotcha! thanks for the clarification