[nikhilsimha]

So the writes are O(N) then - to keeps reads at O(1)?

[ryzhyk]

Both reads and writes are O(1) in time complexity. Writes additionally have the log(N) amortized cost of maintaining the LSM tree.

[nikhilsimha]

gotcha! thanks for the clarification