Data-streams and histograms

DOI10.1145/380752.380841zbMath1323.68567OpenAlexW2128869116MaRDI QIDQ5176003

Nick Koudas, Sudipto Guha, Kyuseok Shim

Publication date: 27 February 2015

Published in: Proceedings of the thirty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/380752.380841

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)

Related Items

Strongly polynomial efficient approximation scheme for segmentation ⋮ Comment: Monitoring networked applications with incremental quantile estimation ⋮ Continuous monitoring of distributed data streams over a time-based sliding window ⋮ Multivariate network traffic analysis using clustered patterns ⋮ Fluctuated Fitting Under the $$\ell _1$$ -metric ⋮ Sampling Technique for Complex Data ⋮ Outlier respecting points approximation ⋮ A new approach to building histogram for selectivity estimation in query processing optimization ⋮ Homogeneous string segmentation using trees and weighted independent sets ⋮ Finding longest increasing and common subsequences in streaming data ⋮ Depth First Search in the Semi-streaming Model ⋮ On graph problems in a semi-streaming model

Cites Work

• A constant-factor approximation algorithm for the k -median problem (extended abstract)