Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,100,399 papers from all fields of science
Search
Sign In
Create Free Account
Count–min sketch
Known as:
CM sketch
, Count Min sketch
, Count-min sketch
In computing, the count–min sketch (CM sketch) is a probabilistic data structure that serves as a frequency table of events in a stream of data. It…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
10 relations
Bloom filter
Count-distinct problem
Data structure
Feature hashing
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Buffered Count-Min Sketch on SSD: Theory and Experiments
Mayank Goswami
,
Dzejla Medjedovic
,
Emina Mekic
,
P. Pandey
Embedded Systems and Applications
2018
Corpus ID: 13744712
Frequency estimation data structures such as the count-min sketch (CMS) have found numerous applications in databases, networking…
Expand
2017
2017
Buffered Count-Min Sketch
E. Eydi
,
Dzejla Medjedovic
,
Emina Mekic
,
Elmedin Selmanovic
2017
Corpus ID: 125352030
In this paper, we present the preliminary work on the adaptation of Count-Min sketch (CMS) data structure to the external storage…
Expand
2016
2016
Count-Min Tree Sketch: Approximate counting for NLP
Guillaume Pitel
,
G. Fouquier
,
Emmanuel Marchand
,
Abdul Mouhamadsultane
arXiv.org
2016
Corpus ID: 9810073
The Count-Min Sketch is a widely adopted structure for approximate event counting in large scale processing. In a previous work…
Expand
2015
2015
Cardinality Estimation in Shared-Nothing Parallel Data Flows
Tamara Mendt
2015
Corpus ID: 59950324
Shared nothing parallel dataflow systems aim to bridge the gap between MapReduce and RDBMSs by combining parallel execution of…
Expand
2014
2014
Analysis of the Count-Min Sketch Based Anomaly Detection Scheme in WSN
Guorui Li
,
Y. Liu
,
Y. Wang
IEEE 13th International Conference on Trust…
2014
Corpus ID: 15259007
The constrained capacity of wireless sensor nodes and harsh, unattended deploy environments make the data collected by sensor…
Expand
2011
2011
b-Bit Minwise Hashing for Large-Scale Learning
Ping Li
,
Anshumali Shrivastava
,
Joshua L. Moore
,
A. König
2011
Corpus ID: 16063947
Abstract Minwise hashing is a standard technique in the context of search for efficiently computing set similarities. The recent…
Expand
2010
2010
Streaming Algorithms : Frequency Moments and Count-Min Sketch
Amirali Salehi-Abari
2010
Corpus ID: 16829125
Usually, a streaming algorithm is used in scenarios in which there are a lot of data (items) arriving and there is a space or…
Expand
2010
2010
Sketch Techniques for Scaling Distributional Similarity to the Web
Amit Goyal
,
Jagadeesh Jagarlamudi
,
Daumé
,
H. Iii
,
Suresh Venkatasubramanian
2010
Corpus ID: 475811
In this paper, we propose a memory, space, and time efficient framework to scale distributional similarity to the web. We exploit…
Expand
2009
2009
CM Sketch
Encyclopedia of Database Systems
2009
Corpus ID: 7867041
2005
2005
New estimation methods of Count-Min sketch
Hongsong Li
,
Houkuan Huang
International Workshop on Research Issues in Data…
2005
Corpus ID: 15796220
Count-Min sketch is an efficient approximate query tool for data stream. In this paper we address how to further improve its…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE