Essays about: "Count-Min Sketch"
Found 2 essays containing the words Count-Min Sketch.
University essay from Göteborgs universitet/Institutionen för data- och informationsteknik
Abstract : The frequent elements problem involves processing a stream of elements and finding all elements that occur more than a given fraction of the time. A relaxed versionof this problem is the -approximate elements problem which allows some false positives. READ MORE
2. TupleSearch : A scalable framework based on sketches to process and store streaming temporal data for real time analyticsUniversity essay from Mittuniversitetet/Avdelningen för informationssystem och -teknologi
Abstract : In many fields, there is a need for quick analysis of data. As the number of devices connected to the Internet grows, so does the amounts of data generated. The traditional way of analyzing large amounts of data has been by using batch processing, where the already collected data is pro-cessed. READ MORE