...>98%30数据字典命中率(Dictionary Cache)>98%30库缓存命中率(Library Cache)>98%30内存中的排序(Sort in Memory)>98%30空闲的数据缓冲区比例10-25%30使用最多的前10个SQL占用的内存<5%60是否已经调整使用最多的前25个SQL是30是否尝试固定高...
基于24个网页-相关网页
This instructs DB2 to pass the index keys to the sort program in memory, rather than having the keys written to and read once again from sort work files on DASD.
这将指示DB 2将索引键传递给内存中的排序程序,而不是再次将这些键写到DASD上的排序工作文件中,然后从中读取这些键。
If the sort will fit in memory, it will be very fast; otherwise, it overflows to disk and will be much slower.
如果排序可在内存中进行,它将非常快;否则,它会溢出到磁盘,而且慢得多。
Examples of operations that use the sort heap include hash joins and operations where the table is in memory.
使用排序堆的操作示例包括内存中表的散列连接和操作。
These are sort of the cells, if you like, in memory that are holding the elements of the list.
记忆就像是数组中的元素,我们之前说的是,我在这里开始并且比较。
And then now they've put in a centre de memoire, sort of a memory site there, that's kind of slick but it's fine.
现在他们造了一个回忆中心,算是一个供人回忆的地方,有点假不过还行
应用推荐