A computer system affords a user the ability to interactively formulate, visualize, and modify query plans that are to be posed to a database. The computer system provides query visualization in the form of decision trees having nodes selectable/deselectable to search for alternative query plans with lower or minimum execution time. The estimated cost and/or the execution time of a subtree of a query plan may be mapped according to a rectangle area metaphore, with the area of a rectangle enclosed by a larger rectangle representing a parent node in the plan tree. Query plans may be saved by the system in order to facilitate their visualization, optimization, and/or modification at a later date.
Legal claims defining the scope of protection, as filed with the USPTO.
1. A computer-implemented method comprising: providing in a non-transitory computer readable storage medium at a server, a database comprising data organized in tables; posing a query to the database through an engine; causing the engine to provide to a user, a visual representation of a database query plan search space, wherein the visual representation comprises a tree structure including a plurality of nodes, and wherein a cost is associated with each of the plurality of nodes; causing the engine to provide to the user, a second visual representation of the database query plan search space, wherein the second visual representation comprises a plurality of polygons, wherein the plurality of polygons correspond to the plurality of nodes, and wherein an area of each polygon depends on the cost of each corresponding node; based upon the visual representation of the database query plan search space, providing a query plan manipulation request to the database through the engine, wherein the query plan manipulation request corresponds to a direct manipulation of the visual representation; returning to the engine from the database, a result of the query plan manipulation request; causing the engine to display the result to the user; and storing the result in a second non-transitory computer readable storage medium.
2. The method of claim 1 further comprising displaying the cost of an individual node based upon interaction between the user and the visual representation through an interface.
3. The method of claim 1 wherein the result comprises an actual execution time.
4. The method of claim 1 wherein the result comprises an estimated cost generated by an optimizer module.
5. The computer-implemented method of claim 1 , further comprising: receiving a user selection; and selectively displaying one of the visual representation and the second visual representation, according to the user selection.
6. The computer-implemented method of claim 1 , wherein the plurality of polygons includes at least two overlapping rectangles.
7. The computer-implemented method of claim 1 , wherein the plurality of polygons includes a first rectangle that is completely overlapped by a second rectangle.
8. The computer-implemented method of claim 1 , wherein the plurality of polygons includes a first rectangle associated with a first cost that is overlapped by a second rectangle associated with a second cost, wherein the first cost is less than the second cost.
9. The computer-implemented method of claim 1 , wherein the plurality of polygons includes a first rectangle, a second rectangle, and a third rectangle, wherein the first rectangle completely overlaps the second rectangle and the third rectangle, and wherein the second rectangle and the third rectangle do not overlap.
10. A non-transitory computer readable storage medium embodying a computer program for performing a method, said method comprising: posing through an engine, a query to a database stored in a second non-transitory computer readable storage medium at a server, the database comprising data organized in tables; causing the engine to provide to a user, a visual representation of a database query plan search space, wherein the visual representation comprises a tree structure including a plurality of nodes, and wherein a cost is associated with each of the plurality of nodes; causing the engine to provide to the user, a second visual representation of the database query plan search space, wherein the second visual representation comprises a plurality of polygons, wherein the plurality of polygons correspond to the plurality of nodes, and wherein an area of each polygon depends on the cost of each corresponding node; based upon the visual representation of the database query plan search space, providing a query plan manipulation request to the database through the engine, wherein the query plan manipulation request corresponds to a direct manipulation of the visual representation; returning to the engine from the database, a result of the query plan manipulation request; causing the engine to display the result to the user; and storing the result in the non-transitory computer readable storage medium.
11. The non-transitory computer readable storage medium of claim 10 further comprising code to display the cost of an individual node, based upon interaction between the user and the visual representation through an interface.
12. The non-transitory computer readable storage medium of claim 10 wherein the result comprises an actual execution time.
13. The non-transitory computer readable storage medium of claim 10 wherein the result comprises an estimated cost generated by an optimizer module.
14. A computer system comprising: one or more processors; a non-transitory computer readable storage medium storing a software program, executable on said computer system, the software program configured to: pose through an engine, a query to a database stored in a second non-transitory computer readable storage medium at a server, the database comprising data organized in tables; cause the engine to provide to a user, a visual representation of a database query plan search space, wherein the visual representation comprises a tree structure including a plurality of nodes, and wherein a cost is associated with each of the plurality of nodes; causing the engine to provide to the user, a second visual representation of the database query plan search space, wherein the second visual representation comprises a plurality of polygons, wherein the plurality of polygons correspond to the plurality of nodes, and wherein an area of each polygon depends on the cost of each corresponding node; based upon the visual representation of the database query plan search space, provide a query plan manipulation request to the database through the engine, wherein the query plan manipulation request corresponds to a direct manipulation of the visual representation; return to the engine from the database, a result of the query plan manipulation request; cause the engine to display the result to the user; and store the result in the non-transitory computer readable storage medium.
15. The computer system of claim 14 further comprising displaying the cost of an individual node, based upon interaction between the user and the visual representation through an interface.
16. The computer system of claim 14 wherein the result comprises an actual execution time.
17. The computer system of claim 14 wherein the result comprises an estimated cost generated by an optimizer module.
Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.
December 12, 2011
September 16, 2014
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.