Instead, use an in memory hash table to cache the data and just keep a key to the data in the session.
相反地，应该使用内存中的哈希表来缓存数据，并且在会话中保存一个对此数据进行引用的键。
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.
在满足筛选器条件的每个行中，数据库服务器将对键应用哈希函数，并探测哈希表以查找匹配的键值。
You can think of a hash table conceptually as a series of buckets, each with an address that is derived form the key value by applying the hash function.
可以在概念上将哈希表认为是一系列的bucket，每个 bucket 所拥有的地址是通过应用哈希函数从键值导出的。
Key-values Stores. The main idea here is using a hash table where there is a unique key and a pointer to a particular item of data.
KV存储的主要思想是一个哈希表，每个item有一个主键和特定的数据值。
One of the recommendations shown for the LINEITEM table is to change the hash partitioning key.
关于lineitem表的一个建议是更改hash分区键。
The next-fastest data structure is HashMap, followed by ThreadLocal (essentially, a specialized hash table in which the current thread is the key).
更慢一点儿的数据结构是HashMap，然后是ThreadLocal(这基本上是一个以当前线程作为键的特殊散列表)。
For each logging token read from the Shared memory or configuration file on its first invocation, OPEN_LOG builds a hash key using the name of the token and the size of the hash table.
对于每个从共享内存或初次调用使用的配置文件中读取的日志标记，OPEN_LOG都会使用标记名和散列表的大小来生成一个散列值。
This class builds a hash table of key-value pairs at the class instantiation.
此类在类实例化时构建一个键值对哈希表。
It's sometimes known as an associative array because data is associated with a key value, or as a hash table.
它有时候称为关联数组(因为数据与一个键值相关联)，或者作为散列表。
The smallest table is scanned first, and the hash table is populated with Pointers to the rows that match each key.
最小的表首先被扫描，然后哈希表被填入相匹配的每个键的行指针。
The smallest table is scanned first, and the hash table is populated with Pointers to the rows that match each key.
最小的表首先被扫描，然后哈希表被填入相匹配的每个键的行指针。
应用推荐