A running total that does not lie about ties

A running total that does not lie about ties comes up often enough to be worth a note. support-tickets is a convenient thing to try it on — 4,000 rows, one row per ticket.

select opened_at,
       first_response_min,
       sum(first_response_min) over (
         order by opened_at
         rows between unbounded preceding and current row
       ) as running_first_response_min
from support_tickets
order by opened_at;

The frame clause is not optional decoration. Leave it out and you get range between unbounded preceding and current row, which includes every peer row with the same ordering value — so on a column with duplicate timestamps the running total jumps early and no error is raised.

Run it against the real file in the SQL playground — the engine there is enough of a SQL implementation to execute this as written, and the dataset is already loaded. The pattern page has the version with the failure modes spelled out.

Window functions are the difference between SQL that describes rows and SQL that describes sequences. Almost every "we exported it to pandas to do this bit" turns out to be one of these five.