ArticleScientific reports2026
Gentle-Sketch: a high-performance and compact invertible sketch for top-K estimation.
Article in Scientific reports, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
6 authors.
Funding
Abstract
Top-k estimation has been a significant research focus in network data stream processing, owing to its broad range of applications. However, the rapid detection of top-k frequent flows in massive network traffic poses considerable challenges, primarily due to the stringent requirements for high-speed packet processing and constraints in resource availability. Invertible sketches, as summary data structures, enable the recovery of top-k flows with limited memory usage and bounded error guarantees. To the best of our knowledge, most existing invertible sketch algorithms suffer from high memory access overhead, which adversely affects their performance in top-k estimation. This article proposes Gentle-Sketch, a high-performance and compact invertible sketch that supports top-k estimation using small and statically allocated memory. Designed around the inherent characteristics of data streams, Gentle-Sketch adopts an adaptive structure that organizes multiple buckets in a specific manner. The entry size per bucket is tailored to match the stream distribution. Gentle-Sketch hashes each flow to multiple buckets and flexibly relocates overflowing flows, improving memory utilization. This mechanism preserves elephant flows and incorporates more mice flows without throughput loss. Extensive experimental results demonstrate that Gentle-Sketch achieves invertibility while maintaining high accuracy and throughput in top-k estimation compared to existing sketch algorithms. In particular, compared to the state-of-the-art Double-Anonymous Sketch, Gentle-Sketch improves estimation precision by over 20% and increases throughput by more than a factor of two.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.