由于随机哈希函数不可逆，目前的概要数据结构不得不遍历关键字地址空间以查找和估计频繁项集。
Due to the irreversibility of random hash mapping, current sketch data structures have to traverse the key address space to find frequent items.
由于随机哈希函数不可逆，目前的概要数据结构不得不遍历关键字地址空间以查找和估计频繁项集。
Due to the irreversibility of random hash mapping, current sketch data structures have to traverse the key address space to find frequent items.
应用推荐