Abstract:
Aspects of the present disclosure describe systems and methods for providing active session history data to users for use in database performance analysis. In various aspects, active session history data obtained from monitoring a database and/or database system over a period of time may be segmented into multiple dimensions. The segmented data may be subsequently provide and/or displayed on one or more interfaces, such as a graphical user interface, to users. The interface may visualize the dimensional ASH data in a variety of ways, such as through icons, graphs, charts, histograms, temporal delineations, treemaps, etc.
Abstract:
A method for resolving a hang in a database system includes receiving a symbolic graph having a plurality of nodes, where each node represents a database session involved in the hang during a specified time interval. The blocking time associated with each node in the symbolic graph is recursively determined. The node that has the longest blocking time is output to a display for review by the database administrator. Alternatively, the database session represented by the node having the longest blocking time may be automatically eliminated.
Abstract:
Approaches, techniques, and mechanisms are disclosed for ensuring that a database command is executed according to a query plan that has been verified to be actually optimal. Except in rare circumstances, a database server does not execute a query plan unless it is first verified by the database server. The database server receives a request to execute a database command. The database server determines an unverified plan is the best plan for satisfying the request. Rather than risk the unknown behavior of an unverified plan, the database server instead satisfies the request according to a verified plan. Subsequently—for example as part of a scheduled job—the database server executes the unverified plan to determine performance statistics. Based at least on the performance statistics, the database server determines whether or not to verify the unverified plan. Techniques for concurrent and optimistic verifications are also disclosed.
Abstract:
Aspects of the present disclosure describe systems and methods for providing active session history data to users for use in database performance analysis. In various aspects, active session history data obtained from monitoring a database and/or database system over a period of time may be segmented into multiple dimensions. The segmented data may be subsequently provide and/or displayed on one or more interfaces, such as a graphical user interface, to users. The interface may visualize the dimensional ASH data in a variety of ways, such as through icons, graphs, charts, histograms, temporal delineations, treemaps, etc.
Abstract:
Techniques are provided for a fully-automated process for tuning database query language statements that selects database query language statements for tuning, tunes the database query language statements and generates tuning recommendations, tests the tuning recommendations, and determines whether to implement the tuning recommendations based on the test results. The fully-automated tuning process may also automatically implement certain tuning recommendations and monitor the performance of the database query language statements for which tuning recommendations have been implemented.
Abstract:
Approaches, techniques, and mechanisms are disclosed for ensuring that a database command is executed according to a query plan that has been verified to be actually optimal. Except in rare circumstances, a database server does not execute a query plan unless it is first verified by the database server. The database server receives a request to execute a database command. The database server determines an unverified plan is the best plan for satisfying the request. Rather than risk the unknown behavior of an unverified plan, the database server instead satisfies the request according to a verified plan. Subsequently—for example as part of a scheduled job—the database server executes the unverified plan to determine performance statistics. Based at least on the performance statistics, the database server determines whether or not to verify the unverified plan. Techniques for concurrent and optimistic verifications are also disclosed.
Abstract:
A method for resolving a hang in a database system includes receiving a symbolic graph having a plurality of nodes, where each node represents a database session involved in the hang during a specified time interval. The blocking time associated with each node in the symbolic graph is recursively determined. The node that has the longest blocking time is output to a display for review by the database administrator. Alternatively, the database session represented by the node having the longest blocking time may be automatically eliminated.