heap organized table 堆组织表 ; 堆表
Heap Organize Table 表是堆组织表 ; 堆组织表 ; 使用的堆组织表
Descriptor Heap and Table 描述符堆和表
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.
如果无法将排序的数据整个放入排序堆中(排序堆是每次执行排序时分配的一块内存),它就会溢出到该数据库所有的临时表中。
Examples of operations that use the sort heap include hash joins and operations where the table is in memory.
使用排序堆的操作示例包括内存中表的散列连接和操作。
The bytecode interpreter adds about 65mb to the process table (over the maximum heap size for a 128mb heap), and increases in size as does the maximum heap size does.
字节码解释器向进程表大约添加65 MB(除了最大堆大小128 MB之外),并随最大堆大小的增加而增加。
应用推荐