Circllhist – A Log-Linear Histogram Data Structure for IT Infrastructure Monitoring

01/17/2020
by   Heinrich Hartmann, et al.
0

The circllhist histogram is a fast and memory efficient data structure for summarizing large numbers of latency measurements. It is particularly suited for applications in IT infrastructure monitoring, and provides nano-second data insertion, full mergeability, accurate approximation of quantiles with a-priori bounds on the relative error. Open-source implementations are available for C/lua/python/Go/Java/JavaScript.

READ FULL TEXT
research
07/07/2020

The CMS monitoring infrastructure and applications

The globally distributed computing infrastructure required to cope with ...
research
10/28/2022

System Demo: Tool and Infrastructure for Offensive Language Error Analysis (OLEA) in English

The automatic detection of offensive language is a pressing societal nee...
research
10/06/2022

(1-ε)-approximate fully dynamic densest subgraph: linear space and faster update time

We consider the problem of maintaining a (1-ϵ)-approximation to the dens...
research
06/05/2023

Fast Partitioned Learned Bloom Filter

A Bloom filter is a memory-efficient data structure for approximate memb...
research
02/11/2019

Computing Extremely Accurate Quantiles Using t-Digests

We present on-line algorithms for computing approximations of rank-based...
research
02/27/2020

Piecewise linear regressions for approximating distance metrics

This paper presents a data structure that summarizes distances between c...
research
09/06/2020

The Mixture Graph-A Data Structure for Compressing, Rendering, and Querying Segmentation Histograms

In this paper, we present a novel data structure, called the Mixture Gra...

Please sign up or login with your details

Forgot password? Click here to reset