Accurate and precise aggregation counting

DOI10.1016/J.JCSS.2011.02.002zbMATH Open1242.68094OpenAlexW2009020737MaRDI QIDQ414868FDOQ414868

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

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

zbMATH Keywords

aggregationduplicate-insensitivesensors networks

Mathematics Subject Classification ID

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

Cites Work

• Probabilistic counting algorithms for data base applications

Cited In (2)

• Target counting with Presburger constraints and its application in sensor networks
• Title not available (Why is that?)

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)