sliding-window

Consider the following table: SELECT id, value FROM table ORDER BY id ASC; +-----+---------+ | id | value | +-----+---------+ | 12 | 158 | | 15 | 346 | | 27 | 334 | | 84 | 378 | | 85 | 546 | +-----+---------+ The id column is auto-incremented but contains gaps. The value column is numeric. I want to look at the increase in value over time by setting value in relation to the value two rows above. That is for row id=85 I want to set the value of row id=85 (546) in relation to the value of row id=27 (334). The value to be computed for row id=85 is hence 546/334=1.63473. This is the result I want

While solving a geometry problem, I came across an approach called Sliding Window Algorithm. Couldn't really find any study material/details on it. What is the algorithm about? Generally speaking a sliding window is a sub-list that runs over an underlying collection. I.e., if you have an array like [a b c d e f g h] a sliding window of size 3 would run over it like [a b c] [b c d] [c d e] [d e f] [e f g] [f g h] This is useful if you for instance want to compute a running average, or if you want to create a set of all adjacent pairs etc. Sliding window is a problem solving technique for