← Back
Home › Systems › Communication and media

audience-measurement

TV and streaming audience ratings

Nielsen, Kantar, VideoAmp

SystemTechniques · 22Primitives · 66 audience-measurement Partitioned commit logdistributed · medium: A topic split into replicated append-only partitions: key hash keeps per-key order, offsets give position, and a high watermark limits readers to fully replicated records.›Windowed stream aggregationdistributed · medium: Group events by event-time window per key, keep one partial aggregate per slice, and emit a window when the watermark passes its end.›Audio fingerprintingmedia · medium: Spectral-peak landmark hashes to identify recordings robustly to noisePsychoacoustic modelmedia · medium: Masking thresholds driving perceptual bit allocationData deidentificationsecurity · medium: Pseudonymization, generalization and k-anonymity for sharing health or personal datasetsInvisible watermarkingsecurity · medium: Embedding robust imperceptible marks in images/audio/video or token sampling for later detectionStatistical data fusionstatistics · medium: Combine two surveys with different respondents via common variables (hot-deck or statistical matching) to impute a joint distributionShort-time Fourier transform and sp…signal-processing · low: Slide a window over a signal and FFT each frame to get a time-frequency picture; the front end of audio ML, vibration and radar analysis.›Forward error correctionsignal-processing · low: Add redundancy (LDPC, Reed-Solomon, XOR parity) so receivers repair loss without retransmitHyperLogLogdata-structures · low: Counts distinct elements in kilobytes with about 1 % error by tracking the longest run of leading zero bits in hashed values per bucket.›Event deduplication windowdistributed · low: Keep the ids of recently accepted events for a time window and drop repeats; memory stays bounded by rotating time buckets instead of per-entry timers.›Low power duty cyclingembedded · low: MCU sleep states, wake sources and radio duty cycling to run years on a batteryPerceptual hashingsearch-sort · low: Compact fingerprints (64 to 256 bits) of an image that stay close under resizing and recompression, compared by Hamming distance; pHash, dHash and Meta's PDQ.›Bootstrap confidence intervalsstatistics · low: Resampling-based confidence intervals for arbitrary statisticsSessionizationstorage · low: Group events into sessions by inactivity gapsFast hash functionsdata-structures · low: Non-cryptographic hashes built from 64×64→128-bit multiplies and xor-shifts; pick by key size, trust level and whether the hash is persisted.›Consumer offsetsdistributed · low: Each consumer group stores one integer per partition, the next position to read, so a restarted consumer resumes where it left off with at-least-once delivery.›Segmented logdistributed · low: Split an append-only log into files named by their first offset, write only the newest, and find any record by binary search plus a sparse index.›Zero-copy I/Onetworking · low: Move bytes between files, sockets and NICs by passing page references instead of copying through user space: sendfile, splice, MSG_ZEROCOPY, kTLS.›Hash aggregationstorage · low: GROUP BY via hash tables with partitioning and spill to diskHierarchical timing wheelsystems · low: Timers bucketed by expiry into wheels of slots, coarser wheels for far deadlines: O(1) insert and cancel for millions of timeouts.›Peak detectionsignal-processing · low: Robust peak and event detection in noisy signals with adaptive thresholds and refractory periodsFast Fourier transformnumerics · low: Computes the DFT in O(n log n) by recursively splitting into even and odd halves; the basis of fast convolution and spectral methods.›+ 15 more techniques+ 50 more primitives

Similar systems

Share the most building blocks with this one.