Accurate and precise aggregation counting

DOI10.1016/J.JCSS.2011.02.002MaRDI QIDQ414868zbMATH OpenOpenAlexFDO

Authors F. P. Preparata

Publication date 11 May 2012

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcss.2011.02.002

zbMATH Keywords

aggregationduplicate-insensitivesensors networks

Mathematics Subject Classification ID

Distributed systems (68M14) Information storage and retrieval of data (68P20)

Recommendations

• Approximate counting with a floating-point counter
• How to count quickly and accurately: a unified analysis of probabilistic counting and other related problems
• Approximate counting: a detailed analysis
• A flexible way of counting large numbers approximately in small registers
• On distributed cardinality estimation: random arcs recycled

Cites work

• Probabilistic counting algorithms for data base applications

Cited in

(2)

• scientific article; zbMATH DE number 1950679 (Why is no real title available?)
• Target counting with Presburger constraints and its application in sensor networks

Describes a project that uses

Uses Software

• TAG

This page was built for publication: Accurate and precise aggregation counting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q414868)