News for hackers. Stuff that matters.

A comment on Feldera Incremental Compute Engine. Parent comment

Re:Feldera Incremental Compute Engine by nikhilsimha on Monday September 30, 2024 @12:12PM (#41698828)
So the writes are O(N) then - to keeps reads at O(1)?
[ Parent | on HN ]
Re:Feldera Incremental Compute Engine by ryzhyk on Monday September 30, 2024 @12:20PM (#41698928)
Both reads and writes are O(1) in time complexity. Writes additionally have the log(N) amortized cost of maintaining the LSM tree.
[ Parent | on HN ]
Re:Feldera Incremental Compute Engine by nikhilsimha on Monday September 30, 2024 @12:50PM (#41699306)
gotcha! thanks for the clarification
[ Parent | on HN ]