Because of the number of table scans and table sorts in the TPC-H workload, prefetching data from disks into memory is important for optimal performance.
因为TPC - H工作负载中表扫描和表排序的数量较多，所以为获得最佳性能将数据从磁盘预取到内存是很重要的。
This helps ensure the data for this table is continuously cached in memory.
这有助于确保此表中的数据连续地缓存在内存中。
Instead, use an in memory hash table to cache the data and just keep a key to the data in the session.
相反地，应该使用内存中的哈希表来缓存数据，并且在会话中保存一个对此数据进行引用的键。
This allows the entire lookup table to be loaded into memory each time a user submits a request to read or write data.
在用户每次提交一个读写数据的请求时，这可以将要查询的整个表装入内存中。
If the sorted data cannot fit entirely into the sort heap, which is a block of memory that is allocated each time a sort is performed, it overflows into a temporary table owned by the database.
如果无法将排序的数据整个放入排序堆中(排序堆是每次执行排序时分配的一块内存)，它就会溢出到该数据库所有的临时表中。
The snippet processor reads table data from the disk array into memory.
snippet处理器将表数据从硬盘阵列读取到内存中。
This is because Oracle uses a lot of virtual memory, particularly with respect to its System Global Area (SGA), which is used to cache table data, among other things.
这是因为Oracle使用大量的虚拟内存，特别是对于其系统全局区域（SGA），这个区域用于缓存表数据和其他东西。
HSQLDB keeps all table and index data in memory, saving all SQL statements issued into a file named database.script, which also ACTS as the transaction log.
HSQLDB将所有表和索引数据放在内存中，将所有发出的sql语句保存到一个名为database .script的文件中，该文件同时也充当着事务日志的角色。
Why does a hash table take up more memory than other data-structures?
为什么一个哈希表也需要更多的内存比其他的数据结构？
Memory data are stored in table set, and data index is set up by hash table.
采用表集的方式存储各类内存数据，通过哈希表建立数据索引。
In this case, CLR has a dedicated data structure called Card Table to record whether the application writes the memory of generation 1 or 2.
针对这种情况，CLR有专门的数据结构(Cardtable)来标志应用程序是否曾经写第1代或者第2代的内存。
In this case, CLR has a dedicated data structure called Card Table to record whether the application writes the memory of generation 1 or 2.
针对这种情况，CLR有专门的数据结构(Cardtable)来标志应用程序是否曾经写第1代或者第2代的内存。
应用推荐