If the size of the data to sort is too large, the data must go to temporary files on disk and be sorted again.
如果要排序的数据太大，那么数据就必须保存到磁盘上的临时文件中，并再次进行排序。
If the sort will fit in memory, it will be very fast; otherwise, it overflows to disk and will be much slower.
如果排序可在内存中进行，它将非常快；否则，它会溢出到磁盘，而且慢得多。
For example, if there were an excessive amount of sorting such that the sort heap spilled to disk, performance would suffer.
比如说，如果出现大量排序操作，导致排序堆被溢出到磁盘上，那么性能就会受到影响。
Here are some techniques for avoiding long-running actions in the UI thread, using a common example: a table or tree that is filled from some sort of database query, network call, or disk.
有一些技术用来避免UI线程中的长时间运行动作，举一个常见的例子：使用某种数据库查询、网络调用或磁盘进行填充的表或树。
When MySQL must perform a sort, it allocates a sort buffer to store the rows as they're read from disk.
当MySQL必须要进行排序时，就会在从磁盘上读取数据时分配一个排序缓冲区来存放这些数据行。
Largest sort provides the maximum sort space used on disk.
LargestSort是磁盘上使用的最大排序空间。
Largest sort provides the maximum sort space used on disk.
LargestSort是磁盘上使用的最大排序空间。
应用推荐