Frequent item mining algorithms need to perform as little data streamscanning as possible while using limited size of memory.
数据流频繁项挖掘算法需要利用有限的内存，以尽量少的次数扫描数据流就能得到频繁项。
2
It also details in concrete terms the composition of the three tokens (a plus sign, a minus sign, and an integer) that the parser expects to encounter while scanning through the input stream.
它还详细描述了三个记号(加号、减号和整数)组合的具体项，解析器在扫描整个输入流时希望遇到这些项。
3
While minimizing the use of clock cycles, it could decode the coded stream of transform coefficients in each block and output the decoded coefficients in zigzag scanning order.