| 发明名称 |
COUNTING BLOOM FILTER |
| 摘要 |
Technologies are generally described for a scheme for computing a counting number of a keyword. In some examples, a method performed under control of a computing device may include obtaining a result of a j-th set of hash functions with regard to a key; marking a head marker into a bit array of a bloom filter based at least in part on the result of the j-th set of hash functions, if the j is zero; and marking a tail marker into the bit array of the bloom filter based at least in part on the result of the j-th set of hash functions, if the j is the same as or larger than 1. |
| 申请公布号 |
US2016224685(A1) |
申请公布日期 |
2016.08.04 |
| 申请号 |
US201315021133 |
申请日期 |
2013.10.14 |
| 申请人 |
INHA-INDUSTRY PARTNERSHIP INSTITUTE |
发明人 |
NYANG DaeHun |
| 分类号 |
G06F17/30 |
主分类号 |
G06F17/30 |
| 代理机构 |
|
代理人 |
|
| 主权项 |
1. A method performed under control of a computing device, comprising:
obtaining a result of a j-th set of hash functions with regard to a key; marking a head marker into a bit array of a bloom filter based at least in part on the result of the j-th set of hash functions, if the j is zero; and marking a tail marker into the bit array of the bloom filter based at least in part on the result of the j-th set of hash functions, if the j is the same as or larger than 1, wherein the j is an integer. |
| 地址 |
Incheon KR |
