Accuracy Bounds For The Scaled Bitmap Data Structure
Skip to main content
eScholarship
Open Access Publications from the University of California

Accuracy Bounds For The Scaled Bitmap Data Structure

Abstract

This report describes the scaled bitmap data structure, that can accurately estimate the number of unique elements in a set (assuming the set has a continuously increasing number of elements). This data structure is particular motivated by the need toefficiently count the number of IP addresses, infected by a network worm during an epidemic.

Pre-2018 CSE ID: CS2005-0819

Main Content
For improved accessibility of PDF content, download the file to your device.
Current View