Advanced search

Found 2 essays matching the above criteria.

1. 1. Continuous Parallel Approximate Frequent Elements Queries on Data Streams

   University essay from Göteborgs universitet/Institutionen för data- och informationsteknik

   Author : Victor Jarlow; [2021-10-06]
   Keywords : computer science; big data; Space-Saving; Misra-Gries summary; frequent items; frequent elements; concurrent programming; Delegation Sketch; domain splitting; Count-Min Sketch; Majority algorithm; pproximate frequent-elements algorithm; approximate top-k elements algorithm;

   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 version of this problem is the -approximate elements problem which allows some false positives. READ MORE

3. 2. TupleSearch : A scalable framework based on sketches to process and store streaming temporal data for real time analytics

   University essay from Mittuniversitetet/Avdelningen för informationssystem och -teknologi

   Author : Henrik Karlsson; [2017]
   Keywords : Streaming Data; Stream Processing; Count-Min Sketch; Time Adaptive Sketches;

   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