Database Sort & Hash Join graph
The Database Sort & Hash Join graph contains three series that summarize total sort activity performed for the application over consecutive monitoring intervals:
-
Sorts —Plots the number of completed sorts per monitoring interval.
Note: This value might be higher or lower than the current number of active sorts.
-
Hash joins —Plots the number of completed hash join operations per monitoring interval. Hash joins use sort heap and compete for database manager resources.
-
Active sorts —Plots the number of sorts still active at the end of each monitoring interval.
The bottom of the graph shows the average elapsed time for the sorts that completed in the last monitoring interval.
