Finding frequent items in parallel
Finding frequent items in parallel
Abstract We present a deterministic parallel algorithm for the k ‐majority problem, that can be used to find in parallel frequent items, i.e. those whose multiplicity is greater than a given threshold, and is therefore useful to process iceberg queries and in many other different contexts of applied mathematics and …