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

Hacker News new | past | comments | ask | show | jobs | submit

login

nikhilsimha 3 months ago | parent | context | favorite | on: Feldera Incremental Compute Engine

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

ryzhyk 3 months 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 3 months ago | [–]

gotcha! thanks for the clarification

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact