Location:
Search - bloomfilter
Search list
Description: 拿C编写的boolmfilter算法测试程序，测试程序中只使用了20个节点-Canal C boolmfilter prepared by the algorithm test procedures, test procedures used only 20 nodes
Platform: |
Size: 12758 |
Author: 刘索山 |
Hits:
Description: 拿C编写的boolmfilter算法测试程序，测试程序中只使用了20个节点-Canal C boolmfilter prepared by the algorithm test procedures, test procedures used only 20 nodes
Platform: |
Size: 245760 |
Author: 刘索山 |
Hits:
Description: Bloom filter算法，可以用于网页爬虫中的url排重，很好的一个算法-Bloom filter algorithm, can be used for website url reptiles in the re-scheduling, a good algorithm
Platform: |
Size: 87040 |
Author: 紫川秀 |
Hits:
Description: 布隆过滤器，Hash快速查表的改良快速算法，占用更少的空间-Bloom filter, Hash improved fast algorithm for fast look-up table, take up less space
Platform: |
Size: 1303552 |
Author: 李东辉 |
Hits:
Description: bloom filter basic for eveyone
Platform: |
Size: 91136 |
Author: Anh Nguyen |
Hits:
Description: 关于Bloomfilter的资料，还有实现算法部分的源码。-Information on the Bloomfilter, and part of the source algorithm.
Platform: |
Size: 1265664 |
Author: 曾一晶 |
Hits:
Description: Bloom Filter算法的实现 值得一看 很详细-the implimentation of Bloom Filter algorithm in JAVA.
Platform: |
Size: 41984 |
Author: alina |
Hits:
Description: 大型网页去重算法之一，bloomfliter算法，基于shingling算法进行改良，可处理海量网页数据。-One of large Web pages De-emphasis algorithms: bloomfliter algorithm.Based on the shingling algorithm and be improved, which can handle massive web data.
Platform: |
Size: 1024 |
Author: 杜骊英 |
Hits:
Description: bloomfilter布鲁姆过滤器的java语言实现-bloomfilter Bloom filter java language
Platform: |
Size: 3072 |
Author: allen |
Hits:
Description: 一个基于APHash方法设计的Bloomfilter
构造需要提供参数：size（字符串总数）-The design based on APHash method Bloomfilter. Construct parameter: size (total number of strings)
Platform: |
Size: 1024 |
Author: 刘天元 |
Hits:
Description: bloomfilter过滤器 能够比哈希表更为效率 使用空间更小-the bloomfilter filters can hash table smaller more efficient use of space
Platform: |
Size: 39936 |
Author: 吕晨曦 |
Hits:
Description: 将通过网卡的所有IP进行bloomfilter处理，实现查重。-NIC IP bloomfilter duplication.
Platform: |
Size: 1024 |
Author: 王一鸣 |
Hits:
Description: Java版本的BloomFilter的实现-Implementation of the Java version of BloomFilter
Platform: |
Size: 4096 |
Author: 双木ly |
Hits:
Description: 将通过网卡的所有IP进行bloomfilter处理，实现查重。-NIC IP bloomfilter duplication.
Platform: |
Size: 1024 |
Author: fijrktr |
Hits:
Description: 将通过网卡的所有IP进行bloomfilter处理，实现查重。-NIC IP bloomfilter duplication.
Platform: |
Size: 1024 |
Author: sooFCbnrjtudin |
Hits:
Description: Boolfilter（布隆过滤器）源码 Boolfilter（布隆过滤器）源码-Boolfilter codeBoolfilter codeBoolfilter code
Platform: |
Size: 12288 |
Author: bornwang |
Hits:
Description: 如需要判断一个元素是不是在一个集合中，我们通常做法是把所有元素保存下来，然后通过比较知道它是不是在集合内，链表、树都是基于这种思路，当集合内元素个数的变大，我们需要的空间和时间都线性变大，检索速度也越来越慢。 Bloom filter 采用的是哈希函数的方法，将一个元素映射到一个 m 长度的阵列上的一个点，当这个点是 1 时，那么这个元素在集合内，反之则不在集合内。这个方法的缺点就是当检测的元素很多的时候可能有冲突，解决方法就是使用 k 个哈希 函数对应 k 个点，如果所有点都是 1 的话，那么元素在集合内，如果有 0 的话，元素则不在集合内。-
Such as the need to determine an element is not in a collection, we usually practice is to save all the elements, and then by comparing it is not in the collection, linked list, the tree is based on this idea, when the number of elements within the collection Larger, we need the space and time are linearly larger, more and more slow retri speed. Bloom filter uses a hash function to map an element to a point on an array of length m. When the point is 1, then the element is within the set, and vice versa. The disadvantage of this method is that when the detection of many elements may have a conflict, the solution is to use k hash function corresponding to k points, if all points are 1, then the element in the set, if 0, then the element Is not in the collection.
Platform: |
Size: 5120 |
Author: 李晓阳 |
Hits: