(disclaimer: I work at Materialize and I work with Differential regularly) Differential dataflow lets you write code such that the resulting programs are incremental e.g. if you were computing the most retweeted tweet…
I'm not entirely sure what you mean by n per x, but if by top you mean something like "get top k records by group" then we support that. See [1] for more details. top-k is actually also rendered with a heap-like…
(Disclaimer: I'm one of the engineers at Materialize) > for example, max and min aggregates aren't supported in SQL Server because updating the current max or min record requires a query to find the new max or min…
The aim of the examples is to show what goes wrong in eventually consistent systems where it's possible that two reads of a stream may not be consistent with respect to each other. The examples are not intended to say…
(disclaimer: I work at Materialize and I work with Differential regularly) Differential dataflow lets you write code such that the resulting programs are incremental e.g. if you were computing the most retweeted tweet…
I'm not entirely sure what you mean by n per x, but if by top you mean something like "get top k records by group" then we support that. See [1] for more details. top-k is actually also rendered with a heap-like…
(Disclaimer: I'm one of the engineers at Materialize) > for example, max and min aggregates aren't supported in SQL Server because updating the current max or min record requires a query to find the new max or min…
The aim of the examples is to show what goes wrong in eventually consistent systems where it's possible that two reads of a stream may not be consistent with respect to each other. The examples are not intended to say…