这些代理使用哈希索引来管理资源的目录信息。
These agents manage the directory information of resources using Hash indexing.
您将找到的大部分结果都是哈希索引站点——有意地连接散列值和其相应关键字的站点。
Most of the results you'll find are hash indexing sites — sites intentionally built to connect hash values and their corresponding keys.
哈希索引亡储模式从要非判续索引数据非否亡反在，树立索引数据的位图索引。
Hash index model is to check the index data and create the bitmap index of the index data.
如果连接列上不存在索引，那么优化器将选择动态哈希连接。
The optimizer will choose dynamic hash join if none of the joined columns has index.
只有两处：各行的记录现在是一个字典，而不是一个哈希表，每个记录的元素的后续访问使用已命名的查询，而不是数值索引。
There are only two: the record for each line is now a dictionary rather than a hash, and the subsequent accesses to elements of each record use named lookups instead of numeric indexing.
在前一个实例中，如果customer . customer_num和orders . customer_num都没有被索引，那么优化器将选择动态哈希连接来作为最佳的执行计划。
In the previous example, if customer.customer_num and orders.customer_num are not indexed, dynamic hash join would be chosen by the optimizer as the best execution plan.
当将输入的字符串解析为数字时，我们使用的是哈希表(hash) % idx_for_mon，它保持了每个月份(1. .12)给定缩写的数字索引。
When parsing the input string into its numerical constituents, we use the hash % idx_for_mon, which holds the numerical index of each month (1.. 12) given its acronym.
表索引。标准表或者排序表的最后被定位的行(表循环中当前所在行)。如果访问哈希表，则设置为0。
Table index. Last addressed line of a standard table or sorted table. Is set to 0 if hashed table is accessed.
分析了当前比较典型的P 2 P搜索技术，指出这些搜索方法都是由三种基本方法：洪泛、哈希和索引，结合一定的网络拓扑组合而成的。
Analyzed some typical P2P based search method and found they were composed by specific architecture and three basic methods: flooding, indexing and hashing.
否则，新的哈希数添加到索引和新的数据存储。
Otherwise the new hash number is added to the index and the new data is stored.
采用表集的方式存储各类内存数据，通过哈希表建立数据索引。
Memory data are stored in table set, and data index is set up by hash table.
提出了集成文件管理体系以及多级索引和哈希链表的数据管理方式；
It has also brought forward an integrated file management system and the data management ways of multiple index and hash link-table.
当哈希冲突发生时，系统不会储存新数据，因为它看到它的散列人数已经存在于索引…这就是所谓的假阳性，并可能造成数据丢失。
When a hash collision occurs, the system won't store the new data because it sees that its hash number already exists in the index... This is called a false positive, and can result in data loss.
混纯索引机造采取的索引亡储模型从要无树、哈希和反排文件三类方式。
The index storage models of the hybrid index mechanism have three models: tree model, hash index model and inverted file model.
如果哈希号码已经在索引中的数据块被认为是重复的，并不需要存储一次。
If that hash number is already in the index, the piece of data is considered a duplicate and does not need to be stored again.
当一块数据接收一个哈希数字，这个数字则比其他现有的哈希号码索引。
When a piece of data receives a hash number, that number is then compared with the index of other existing hash Numbers.
重写内核索引节点缓存的哈希表目的默认值。建议内核专家修改。
Override the default number of hash buckets for the kernel's inode cache. Recommended only for kernel experts.
重写内核索引节点缓存的哈希表目的默认值。建议内核专家修改。
Override the default number of hash buckets for the kernel's inode cache. Recommended only for kernel experts.
应用推荐