heap sort

堆排序:利用堆这种数据结构所设计的一种排序算法。堆是一个近似完全二叉树的结构
常用释义
堆排序:利用堆这种数据结构所设计的一种排序算法。堆是一个近似完全二叉树的结构,并同时满足堆的性质:即子节点的键值或索引总是小于(或者大于)它的父节点。

例句

1·Heap Sort has the additional benefit of being quite consistent in its speed, so it is useful in programs where timing is crucial (i. e. networks).

堆排序的另外一个好处是它的速度非常稳定,这让它得以在那些需要严格计时的程序中派上用场(例如网络)。

2·Use appropriate indexes to minimize the use of the sort heap.

使用合适的索引使排序堆的使用降到最低。

3·For example, if there were an excessive amount of sorting such that the sort heap spilled to disk, performance would suffer.

比如说,如果出现大量排序操作,导致排序堆被溢出到磁盘上,那么性能就会受到影响。

4·Sorts that start after the sort heap threshold has been reached may not receive an optimum amount of memory to execute.

在到达排序堆阈值之后开始的排序可能不会接收到最合适的内存数量去执行。

5·The typical consumer of agent private memory is the sort heap memory that is used by the agent to sort rows during query execution.

代理私有内存的常见消费者是排序堆内存,代理在查询执行期间使用这部分内存来对记录行进行排序。

6·Ideally, you should set the sort heap threshold (SHEAPTHRES) parameter to a reasonable multiple of the largest SORTHEAP parameter you have in your database manager instance.

理想情况下,应当将排序堆阈值(SHEAPTHRES)参数合理地设置为在数据库管理器实例中设置的SORTHEAP参数最大值的倍数。

7·You can use the snapshot report to derive information such as the buffer pool hit ratio, amount of sort heap overflows, and the system workload.

您可以使用快照来获得诸如缓冲池命中率、排序堆溢出的次数以及系统工作负载之类的信息。

8·Information about system configuration can include the size of the buffer pool, the sort heap, and more.

关于系统配置的信息包括缓冲池的大小、排序堆的大小等等。

9·It works the same way for sort heap, as we'll see in the sort heap section below.

正如将在下面的排序堆一节中所看到的,它的工作方式与排序堆的相同。

10·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.

如果无法将排序的数据整个放入排序堆中(排序堆是每次执行排序时分配的一块内存),它就会溢出到该数据库所有的临时表中。