By Topic

Experimental Evaluation of Duplicate Insensitive Counting Algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Resvanis, M. ; Dept. of Comput. Eng. & Inf., Univ. of Patras, Patras, Greece ; Chatzigiannakis, I.

Online and realtime counting and estimating the cardinality of sets is highly desirable for a large variety of applications, representing a foundational block for the efficient deployment and access of emerging Internet scale information systems. In this work we implement three well known duplicate insensitive counting algorithms and evaluate their performance in a testbed of resource-limited commercial off-the-shelf hardware devices. We focus on devices that can be used in wireless mobile and sensor applications and evaluate the memory complexity, time complexity and absolute error of the algorithms under different realistic scenario. Our findings indicate the suitability of each algorithm depending on the application characteristics.

Published in:

Informatics, 2009. PCI '09. 13th Panhellenic Conference on

Date of Conference:

10-12 Sept. 2009