4 ms·
Both reads and writes are O(1) in time complexity. Writes additionally have the log(N) amortized cost of maintaining the LSM tree.
by ryzhyk 2y ago
Both 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