Advanced search

Found 1 essay 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