# US 6,725,212 B2 · Platform-independent method and system for graphically presenting the evaluation of a query in a database management system > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 6,725,212 B2 - Document ID: US6725212B2 - Status: Granted - Kind: B2 - Application number: 09/944,921 - Filed: 2001-08-31 - Published: 2003-05-15 - Granted: 2004-04-20 - Earliest claimed: 2001-08-31 - Assignees: International Business Machines Corporation - Inventors: Tanya Couch; Stefan Bengt Edlund; George Lapis; Guy Maring Lohman; Berthold Reinwald - Web page: https://patentgrep.com/patent/US6725212B2 ## CPC - G06F 16/248: Presentation of query results - Y10S 707/99932: Access augmentation or optimizing - Y10S 707/99943: Generating database or data structure, e.g. via user interface - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) - Y10S: TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS ## Abstract A method and system for graphically representing a plan for a query in a relational database management system is disclosed. The method includes receiving and processing an input query to form a plurality of plans, selecting at least one plan of the plurality of plans, and transforming the selected plan into a self-describing formatted file which is platform independent. The method further includes generating a graph representing the selected plan from the self-describing formatted file. ## Claims ### Claim 1 A method for graphically representing a plan for an input query for a relational database management system comprising the steps of: a) receiving an input query; b) processing the input query to form a plurality of structured plans; c) selecting at least one structured plan of the plurality of structured plans; d) transforming the selected structured plan into a self-describing formatted file, wherein the self-describing formatted file is platform independent; and e) generating a graph representing the selected structured plan from the self-describing formatted file. ### Claim 2 (depends on 1) The method of claim 1, wherein the self-describing formatted file is an extensible markup language (XML) file. ### Claim 3 (depends on 2) The method of claim 2, wherein the transforming step (d) further includes: d1) providing a document schema to define the XML file; and d2) utilizing the document schema to translate the selected plan into the XML file. ### Claim 4 (depends on 3) The method of claim 3, wherein the utilizing step (d2) further includes: d2i) mapping the selected plan to the XML using the definitions provided in the document schema. ### Claim 5 (depends on 4) The method of claim 4, wherein the document schema is a description type document (DTD). ### Claim 6 (depends on 1) The method of claim 1, wherein the graph generating step (e) further includes: e1) reading the self-describing formatted file by a self-describing formatted file processor; e2) creating a plurality of nodes according to the self-describing formatted file; and e3) creating a plurality of arcs to connect the plurality of nodes according to the self-describing formatted file to form the graphical representation of the selected plan. ### Claim 7 (depends on 6) The method of claim 6, wherein the graph generating step (e) further includes: e4) collecting detailed information related to each node and associating the related information with each corresponding node, such that the related information is available if requested. ### Claim 8 (depends on 1) The method of claim 1, wherein the relational database management system is a UNIX based system. ### Claim 9 (depends on 1) The method of claim 1, wherein the relational database management system is a WINDOWS based system. ### Claim 10 (depends on 1) The method of claim 1, wherein steps (a)-(d) are performed by the relational database management system. ### Claim 11 (depends on 10) The method of claim 10, wherein step (e) is performed by a client system. ### Claim 12 (depends on 11) The method of claim 11, wherein the client system includes a monitor, the method further including: (f) displaying the graph on the monitor. ### Claim 13 (depends on 1) The method of claim 1, wherein the selected plan is a best query execution plan. ### Claim 14 A computer readable medium containing programming instructions for graphically representing a plan for an input query for a relational database management system, the programming instructions for: a) receiving an input query; b) processing the input query to form a plurality of structured plans; c) selecting at least one structured plan of the plurality of structured plans; d) transforming the selected structured plan into a self-describing formatted file, wherein the self-describing formatted file is platform independent; and e) generating a graph representing the selected structured plan from the self-describing formatted file. ### Claim 15 (depends on 14) The computer readable medium of claim 14, wherein the self-describing formatted file is an extensible markup language (XML) file. ### Claim 16 (depends on 15) The computer readable medium of claim 15, wherein the transforming instruction (d) further includes: d1) providing document schema to define the XML file; and d2) utilizing the document schema to translate the selected plan into the XML file. ### Claim 17 (depends on 16) The computer readable medium of claim 16, wherein the utilizing instruction (d2) further includes: d2i) mapping the selected plan to the XML using the definitions provided in the document schema. ### Claim 18 (depends on 17) The computer readable medium of claim 17, wherein the document schema is a description type document (DTD). ### Claim 19 (depends on 14) The computer readable medium of claim 14, wherein the graph generating instruction (e) further includes: e1) reading the self-describing formatted file by a self-describing formatted file processor; e2) creating a plurality of nodes according to the self-describing formatted file; and e3) creating a plurality of arcs to connect the plurality of nodes according to the self-describing formatted file to form the graphical representation of the selected plan. ### Claim 20 (depends on 19) The computer readable medium of claim 19, wherein the graph generating instruction (e) further includes: e4) collecting detailed information related to each node and associating the related information with each corresponding node, such that the related information is available if requested. ### Claim 21 (depends on 14) The computer readable medium of claim 14, wherein the relational database management system is a UNIX based system. ### Claim 22 (depends on 14) The computer readable medium of claim 14, wherein the relational database management system is a WINDOWS based system. ### Claim 23 (depends on 14) The computer readable medium of claim 14, wherein instructions (a)-(d) are performed by the relational database management system. ### Claim 24 (depends on 23) The computer readable medium of claim 23, wherein instruction (e) is performed by a client system. ### Claim 25 (depends on 24) The computer readable medium of claim 24, wherein the client system includes a monitor, the computer readable medium further including instructions for: (f) displaying the graph on the monitor. ### Claim 26 (depends on 14) The computer readable medium of claim 14, wherein the selected plan is a best query execution plan. ### Claim 27 A system for graphically representing a plan for an input query to a relational database management system (RDBMS), the system comprising: a query compiler in the RDBMS for processing the input query and generating a plurality of structured plans for the input query; means for selecting at least one structured plan of the plurality of structured plans; a self-describing formatted file generator coupled to the query optimizer for transforming the selected structured plan into a self-describing formatted file, wherein the self-describing formatted file is platform independent; and means for generating a graph representing the selected plan from the self-describing formatted file. ### Claim 28 (depends on 27) The system of claim 27, wherein the self-describing formatted file is an extensible markup language (XML) file. ### Claim 29 (depends on 28) The system of claim 28, wherein the means for generating the graph includes a Visual Explain module, the Visual Explain module further including an XML file processor coupled to a graph generator. ### Claim 30 (depends on 29) The system of claim 29, wherein the self-describing formatted file generator utilizes a document schema to transform the selected plan into the XML file. ### Claim 31 (depends on 30) The system of claim 30, wherein the XML file processor includes means for processing the XML file and means for instructing the graph generator to graph the XML file. ### Claim 32 (depends on 31) The system of claim 31, wherein the graph generator includes means for creating a plurality of nodes according to instructions from the XML file processor, and means for creating a plurality of arcs to connect the plurality of nodes to form the graphical representation of the selected plan. ### Claim 33 (depends on 30) The system of claim 30, wherein the document schema is a description type document (DTD). ### Claim 34 (depends on 27) The system of claim 27, wherein the relational database management system is a UNIX based system. ### Claim 35 (depends on 27) The system of claim 27, wherein the relational database management system is a WINDOWS based system. ### Claim 36 (depends on 27) The system of claim 27, wherein the system further includes a client system, wherein the client system includes the means for generating a graph. ### Claim 37 (depends on 36) The system of claim 36, wherein the client system includes a monitor coupled to the means for generating the graph for displaying the graph to a user. ### Claim 38 A method for graphically representing a query execution plan for an input query for a relational database management system comprising the steps of: a) receiving an input query; b) compiling the input query to form a structured query execution plan; c) transforming the structured query execution plan into a file written in Extensible Markup Language (XML), wherein the XML file is platform independent; d) reading the XML file by an XML file processor; e) creating a plurality of nodes according to the XML file; f) collecting detailed information related to each node and associating the related information with each corresponding node, such that the related information is available if requested; and g) connecting the plurality of nodes with a plurality of arcs to generate a graph representing the query execution plan from the XML file. ### Claim 39 (depends on 38) The method of claim 38, wherein the relational database management system is a UNIX based operating system. ### Claim 40 (depends on 38) The method of claim 38, wherein steps (d)-(g) are performed by a client system. ### Claim 41 (depends on 40) The method of claim 40, wherein the client system includes a monitor, the method further including: (h) displaying the graph on the monitor. ### Claim 42 (depends on 38) The method of claim 38, wherein the query execution plan is the best query execution plan.