Hash tables are not organized to support either operation efficiently.
散列表无法高效率地支持这两种操作。
This function reads the XML and returns the data back as an array of hash tables.
该函数读取XML，并作为一组散列表返回数据。
The only available collection data structures are vectors, stacks, enumerations, and hash tables.
唯一可用的集合数据结构是向量栈、枚举和hash表。
In this case, I create an array of hash tables — a common method to store structured data such as this.
在本例中，我创建了一个散列表的数组——用来存储这类结构式数据的一种常见方法。
The example applications starts off by using the SimpleMessageConverter included with Spring to exchange hash tables.
示例应用在一开始就利用Spring中的SimpleMessageConverter来转换哈希表的数据。
The most common use for generic classes is with collections like linked lists, hash tables, stacks, queues, trees, and so on.
泛型类最常用于集合，如链接列表、哈希表、堆栈、队列、树等。
No modification is required to the drawbooks function, because the objects all have the same keys and values as the original hash tables.
不需要对drawbooks函数做任何修改，因为对象都有与原始的散列表相同的键和值。
When hash tables are built, join keys are pushed down and used to filter the rows of the fact table, and performance improves dramatically.
构建散列表时，连接键被下推用于过滤事实表的行，性能也显著提高。
The primary purpose of a push-down hash join is to reduce number of rows processed from the fact table, which probes each of the hash tables.
下推散列连接的主要目的是减少处理的事实表行数，这样可以探测每个散列表。
Here, I set a variable called g_books to an array that contains three hash tables, where each hash table contains information about the book.
这里，我将名为g_books的变量设置为一个包含三个散列表的数组，每个散列表包含关于该书的信息。
For example, suppose that you have a class that stores user information and service information in two separate hash tables, as shown in Listing 3.
例如，假设您有一个类，它用两个单独的散列表来存储用户信息和服务信息，如清单3所示。
In order to support data structures like hash tables and query operations like grouping, anonymous types created by LINQ must provide stable hash codes.
为了支持类似哈希表的数据结构和像分组这样的查询操作，由LINQ创建的匿名类型必须提供稳定的哈希码。
The object model often contains redundant information — for example, to speed searches in hash tables; redundant information means more validation of the XML document.
对象模型常常包含冗余信息，比如用散列表加快搜索的速度，而冗余信息却意味着XML文档需要更多的验证。
A number of conditions can cause leaks, including ever-expanding hash tables, large resource objects being held indefinitely, and global JNI references not being cleaned up.
导致泄漏的原因很多，包括越来越多的散列表、不确定保存的大型资源对象和未清理的全局JNI引用。
Peer-to-peer designs such as distributed hash tables may eliminate some of the centralization issues with DNS, but who knows what governance issues they will bring with them?
点对点设计，比如分布式散列表，可能用DNS消除一些集中问题，但谁知道使用它们将带来什么样的管理问题呢？
For example, if you manage data in hash tables or other unordered data structures in the application domain, you might face additional work re-assembling elements into the order set by a schema.
比方说，如果在应用领域采用哈希表或者其他无序数据结构管理数据，可能会面临着将元素按照模式中的顺序设定重新装配的额外工作。
It compares these algorithms through experimentations. The results shows that the time efficiency of the algorithm based on 2 hash tables is higher than those obtained based on 3 hash tables.
通过实验对这几种算法进行了比较，结果表明基于2个哈希表分类的算法的时间效率要高于基于3个哈希表分类的算法。
Throughout the years, many kinds of data structure had been proposed and applied, for instance, hash tables, binary search tree, digital search tree, ternary search tree and so on and so forth.
在这些年间，有许多种不同的数据结构不断被提出和应用，例如哈希表、二分搜索树、数字查找树、三元搜索树等等。
In this method, one of the tables, usually the smaller one, is scanned and used to create a hash table in memory.
在该方法中，需要扫描其中的一个表，通常扫描较小的那个表，用它在内存中创建一个哈希表。
Join plan directives that force optimizer to use the designated join method to join tables in the query, either nested loop join, sort merge join, or dynamic hash join.
连接计划指示，强制优化器使用指定的连接方法来连接查询中的表，要么是嵌套循环连接、分类合并连接，要么是动态哈希连接。
Supports user, temporary, regular and partitioned tables of different types range, hash and multidimensional clusters.
支持用户表、临时表、常规表以及范围、哈希和多维簇类型的分区表。
The Rainbow tables technique pre-computes the hash value, saving time at the expense of creating very large tables.
Rainbow表方法是预先算出hash值，通过创建很大的表格而节省时间。
But it is possible to attack the hashed value of your password using rainbow tables: enormous, pre-computed hash values for every possible combination of characters.
但是有可能通过rainbow表去攻击密码的hash值：预先计算出来的数量庞大的hash值，涵盖所有可能的字符组合。
If the query includes a join, the optimizer must determine the join plan (hash, sort merge, or nested loop), and the order in which tables are evaluated or joined.
如果该查询包含了连接，那么优化器就必须确定连接计划(hash、sortmerge或nestedloop)，以及评估或连接表的次序。
A hash join method is requested to perform the join between the 'SECURITY' and the 'ORDER' tables.
请求使用一个hash连接方法来执行“SECURITY”和“ORDER”表之间的连接。
A hash join method is requested to perform the join between the 'SECURITY' and the 'ORDER' tables.
请求使用一个hash连接方法来执行“SECURITY”和“ORDER”表之间的连接。
应用推荐