libstatistics-topk-perl 0.02-2 source package in Ubuntu
Changelog
libstatistics-topk-perl (0.02-2) unstable; urgency=medium * Team upload. * No-change source-only re-upload. -- gregor herrmann <email address hidden> Fri, 03 Feb 2023 14:39:41 +0100
Upload details
- Uploaded by:
- Debian Perl Group
- Uploaded to:
- Sid
- Original maintainer:
- Debian Perl Group
- Architectures:
- all
- Section:
- misc
- Urgency:
- Medium Urgency
See full publishing history Publishing
Series | Published | Component | Section | |
---|---|---|---|---|
Oracular | release | universe | misc | |
Noble | release | universe | misc | |
Mantic | release | universe | misc | |
Lunar | release | universe | misc |
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
libstatistics-topk-perl_0.02-2.dsc | 2.4 KiB | 633bc604e3f0b11a561da25634201f2b781afa715501e5e43262d04d8dd3f696 |
libstatistics-topk-perl_0.02.orig.tar.gz | 5.2 KiB | 9b83f0012f18034c906f8d10bcfcd72976529375fd9edc9b5d1c2b9d7e6f8955 |
libstatistics-topk-perl_0.02-2.debian.tar.xz | 1.8 KiB | 60ec0c807a6da2ad336613bcfd2722ad987f857d1ac5fa66308933916f00bb79 |
No changes file available.
Binary packages built by this source
- libstatistics-topk-perl: implementation of the top-k streaming algorithm
The Statistics::TopK module implements the top-k streaming algorithm, also
know as the "heavy hitters" algorithm. It is designed to process data streams
and probabilistally calculate the k most frequent items while using limited
memory.
.
A typical example would be to determine the top 10 IP addresses listed in an
access log. A simple solution would be to hash each IP address to a counter
and then sort the resulting hash by the counter size. But the hash could
theoretically require over 4 billion keys.
.
The top-k algorithm only requires storage space proportional to the number of
items of interest. It accomplishes this by sacrificing precision, as it is
only a probabilistic counter.