Order statistics and estimating cardinalities of massive data sets

DOI10.1016/J.DAM.2008.06.020zbMath1169.68054OpenAlexW2005731313MaRDI QIDQ1003691

Frederic Giroire

Publication date: 4 March 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.06.020

zbMATH Keywords

algorithm analysistraffic analysiscardinality estimatesvery large multisets

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Order statistics; empirical distribution functions (62G30) Data structures (68P05)

Related Items (5)

A Statistical Analysis of Probabilistic Counting Algorithms ⋮ A unified scheme for generalizing cardinality estimators to sum aggregation ⋮ Give me some slack: efficient network measurements ⋮ Fast size approximation of a radio network in beeping model ⋮ Approximating the Size of a Radio Network in Beeping Model

Uses Software

• HyperLogLog

Cites Work

• On adaptive sampling
• Estimating the number of Active Flows in a Data Stream over a Sliding Window
• Algorithms - ESA 2003
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Order statistics and estimating cardinalities of massive data sets