哈希查找

Bloomfilter是一种基于多个哈希函数映射压缩空间的数据结构，通过寻找一种优化的哈希查找算法可以提高Bloomfilter的性能。

Bloom Filter is a kind of data structure based on multiple hash functions mapping to compress the space , and the performance of Bloom Filter can be improved by finding an optimized hash search algorithm .

本文首先介绍Chord分布式哈希查找机制，然后在此基础上分析改进方法：邻近路由算法和邻近邻居选择算法，最后指出了进一步研究的方向。

The paper firstly introduce the mechanism of decentralized hash lookup in Chord , then analyzes its betterment arithmetic , and finally proposes the direction that will further be studied .

基于对等网络的分布式哈希查找机制的研究

Research on the mechanism of decentralized hash lookup based peer-to-peer

它也能处理数目不受限制的带有无限内容大小的变量，具有非常快速的分析和哈希查找功能。

It can also handle an unlimited number of variables with unlimited content size , and with very fast parsing and hashed lookups .

虚拟文件管理采用LRU算法淘汰文件句柄、哈希算法查找文件。

Virtual file manager uses LRU algorithm to evict file handles and hash algorithm to find files .

异或哈希算法查找中文词组性能评价

Performance Evalution of Exclusive-OR Hashing Algorithms for search Chinese Words

在磁盘阵列中实现了基于这种改进的写时拷贝技术的多时间点快照方案，其快照区采用预留方式，并采用哈希表查找已快照过的块，采用多线程技术来加快快照和回退过程。

This improved COW snapshot technique has been implemented in RAID . Its snapshot volume is preserved and uses hash table lookup to find copyed blocks .

如果搜索是时间关键的，二进制搜索或者哈希表查找几乎总是最好的，但是与排序一样，必须记住地址。

If the search is time-critical , a binary search or hash table lookup is almost always best , but as with sorting , you must keep locality in mind .

报文分类算法综合了无冲突哈希以及分组查找等技术。

The package classification algorithm has introduced the concept of the non-conflict hash and the grouping search .

基于CIDR表的哈希地址二分查找算法的改进

Improvement of binary lookup algorithm of Hash addresses based on CIDR list

研究了重复数据删除的基本原理，然后通过以下几个过程：文件数据检测分块、块哈希值计算、块哈希值查找以及哈希值保存，实现了一个基于块级的重复数据删除系统。

Secondly , it studies the basic principle of data de-duplication , and then implements a data de-duplication system based on block level through the following processes : divides files into blocks 、 calculates the hash value of blocks 、 looks up the hash value and saves the hash value .

在满足筛选器条件的每个行中，数据库服务器将对键应用哈希函数，并探测哈希表以查找匹配的键值。

For each row that satisfies the filter condition , the database server applies hash function to the key and proves the hash table to find a match .

Bloomfilter哈希算法采用位向量来存储数据集合，能有效支持元素的哈希查找，是一种能够简洁地表示数据集合并支持集合查询的索引结构，广泛应用于数据库、网络和分布式系统中。

Bloom Filter is an excellent data structure , which can succinctly represent a data set in order to support membership queries . It is widely used in databases , networks and distributed system .

在扫描完第一个表并将它放在哈希表中之后，就扫描第二个表，并在哈希表中查找该表中的每一行，看是否可以进行连接。

After the first table has been scanned and placed in a hash table , the second table is scanned and each row in the table is looked up in the hash table to see if a join can be made .