11

有没有办法使用 Flink Streaming 计算流中唯一单词的数量?结果将是不断增加的数字流。

4

1 回答 1

8

您可以通过存储您已经看过的所有单词来解决问题。有了这些知识,您就可以过滤掉所有重复的单词。然后可以由具有并行性的地图运算符计算其余部分1。下面的代码片段正是这样做的。

val env = StreamExecutionEnvironment.getExecutionEnvironment

val inputStream = env.fromElements("foo", "bar", "foobar", "bar", "barfoo", "foobar", "foo", "fo")

// filter words out which we have already seen
val uniqueWords = inputStream.keyBy(x => x).filterWithState{
  (word, seenWordsState: Option[Set[String]]) => seenWordsState match {
    case None => (true, Some(HashSet(word)))
    case Some(seenWords) => (!seenWords.contains(word), Some(seenWords + word))
  }
}

// count the number of incoming (first seen) words
val numberUniqueWords = uniqueWords.keyBy(x => 0).mapWithState{
  (word, counterState: Option[Int]) =>
    counterState match {
      case None => (1, Some(1))
      case Some(counter) => (counter + 1, Some(counter + 1))
    }
}.setParallelism(1)

numberUniqueWords.print();

env.execute()
于 2016-04-01T08:49:23.143 回答