hash index的例句大全

design and implementation of hash index used in main memory database

用于内存数据库的Hash索引的设计与实现

fortunately, the whole discussion of overflows does not apply to the hash index that i implemented.

幸运的是，针对溢出的全部讨论不会出现在我所实现的hash索引。

forest of trees indexes combine many of the advantages of a hash index with those of a traditional informix b+tree index.

ForestofTrees索引结合了hash索引和传统InformixB+tree索引的许多优势。

the index storage models of the hybrid index mechanism have three models: tree model, hash index model and inverted file model.

混纯索引机造采取的索引亡储模型从要无树、哈希和反排文件三类方式。

Thus, the search in a large file using a hash index is faster than scanning the entire file.

因此，对于较大的文件，使用hash索引进行搜索比扫描整个文件更快。

listing 1. implementation of the hash index key generator

清单1.hash索引键生成器的实现

This article uses a rather basic hash index as an example.

本文使用一个非常基本的hash索引作为例子。

the generated hash value is numeric, and i use this value as single index key for the string being indexed.

生成的hash值是数值型的，我使用这个值作为被索引的字符串的索引键。

Hash-partitioned global indexes offer better performance by spreading out contention when the index is monotonically growing.

全局哈希分区索引(globalhash-index)在索引值单调增长的情况下能够均匀分布索引数据,从而提升系统性能.

Different from the bit-by-bit matching algorithms basd on Radix Trie, or the algorithms based on prefix-length binary-search, it makes the IP destination address match the Trie using binary-search method. And it uses parts of the destination IP address as index to avoid Hash functions.

不同于Radix Trie算法的逐一比特进行比较和对前缀长度进行二分搜索的路由查找，BSTrie采用二分法将IP目的地址与Trie进行匹配，并用部分IP目的地址做索引避免了使用Hash函数。

Hash-partitioned global indexes offer better performance by spreading out contention when the index monotonically growing.

全局哈希分区索引(globalhash-partitionedindex)在索引值单调增长的情况下能够均匀分布索引数据,从而提升系统性能.

Using geographic coding identified by the Hash value to mark the region, and using the Hash value to index the list of users, terrain data, and model object data.

以Hash值标识为区域的地理编码，并以Hash值索引用户列表、地形数据、模型对象数据。

For the needs of quick retrieval mass unstructured temporal information, designed a Multi-indexed Distributed Hash Table ( tDHT) algorithm to realize the retrieval for the temporal attribute value of temporal column quickly and efficiently.

对于时态信息的快速检索需求，设计了多级分布式哈希索引表算法（tDHT），实现对时态列族的时态属性值的高效、快速的检索。

First, three common word segmentation dictionary systems and the dictionary system based on double-character-hash-indexing, Patricia tree and four-character-hash-indexing are studied and explored. Some questions are found in these systems and the unreasonable structures are improved.

本文对三种典型的分词词典机制、基于双字哈希的词典机制、基于PAT树的词典机制及四字哈希词典机制进行了探讨与研究，并针对这些机制存在的问题提出了改进措施。

Design and Implementation of a hash Algorithm that Applies to URL Index in Search Engine

一种应用于搜索引擎URL检索的hash算法设计与实现

a ruby hash (or associative array) is a data structure that allows you to define the key for storage (instead of a simple numerical index).

Ruby散列表（或关联数组）是一种数据结构，允许您定义用于存储的键（而不是简单的数值索引）。

in open addressing, when a data item can't be placed at the index calculated by the hash function, another location in the array is sought.

在开放地址法中，若数据不能直接放在由哈希函数计算出来的数组下标所指的单元时，就要寻找数组的其他位置。