Experiences with approximating inquiries in Microsoft’s manufacturing big-data groups

Experiences with approximating inquiries in Microsoft’s manufacturing big-data groups

Arandom stroll through Computer Science research, by Adrian Colyer

Experiences with approximating questions in Microsoft’s manufacturing big-data clusters Kandula et al., VLDB’19 I’ve been excited in regards to the possibility of approximate question processing in analytic groups for many time, and also this paper describes its usage at scale in production. Microsoft’s big information groups have actually 10s of thousands of devices, as they are employed by a huge number of … Continue reading Experiences with approximating questions in Microsoft’s manufacturing big-data groups

DDSketch: an easy and fully-mergeable quantile design with relative-error guarantees

DDSketch: an easy and fully-mergeable quantile sketch with relative-error guarantees Masson et al., VLDB’19 Datadog handles a lot of metrics – some clients have actually endpoints producing over 10M points per second! For reaction times (latencies) reporting a straightforward metric such as for example ‘average’ is close to worthless. Rather we want to understand what’s happening at various … Continue reading DDSketch: a quick and fully-mergeable quantile design with relative-error guarantees

SLOG: serializable, low-latency, geo-replicated deals

IPA: invariant-preserving applications for weakly constant replicated databases

IPA: invariant-preserving applications for weakly consistent replicated databases Balegas et al., VLDB’19 IPA for designers, pleased times! Continue reading