CA2358126A1 - System and method for recursive path analysis of dbms procedures - Google Patents
System and method for recursive path analysis of dbms procedures Download PDFInfo
- Publication number
- CA2358126A1 CA2358126A1 CA002358126A CA2358126A CA2358126A1 CA 2358126 A1 CA2358126 A1 CA 2358126A1 CA 002358126 A CA002358126 A CA 002358126A CA 2358126 A CA2358126 A CA 2358126A CA 2358126 A1 CA2358126 A1 CA 2358126A1
- Authority
- CA
- Canada
- Prior art keywords
- dependencies
- code
- database
- dependency graph
- dependency
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/28—Databases characterised by their database models, e.g. relational or object models
- G06F16/284—Relational databases
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99931—Database or file accessing
- Y10S707/99932—Access augmentation or optimizing
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99931—Database or file accessing
- Y10S707/99933—Query processing, i.e. searching
- Y10S707/99934—Query formulation, input preparation, or translation
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99941—Database schema or data structure
- Y10S707/99944—Object-oriented database structure
- Y10S707/99945—Object-oriented database structure processing
Abstract
A system, method and database development tools are disclosed for automatically generating the complete dependency graph (12) for use in debugging stored code objects (11) in a database, by using a recursive dependency tracking algorithm (14) which takes into consideration the indire ct dependencies (15) on triggers as well as the dependencies on implementations of object oriented code objects which are represented as separate objects in the database catalog.
Description
SYSTEM AND METHOD FOR RECURSIVE PATH ANALYSIS OF
DBMS PROCEDURES
CROSS-REFERENCE TO RELATED APPLICATIONS
This application is related to application serial number entitled "METHOD AND APPARATUS FOR EXECUTING STORED CODE
OBJECTS IN A DATABASE," filed December 22, 1998.
TECHNICAL FIELD
The invention relates to the field of computer-related systems and methods.
More specifically, the invention is a system and method for automatically generating complete dependency information of DBMS Stored code objects.
BACKGROUND ART
It is desirable to provide efficient and cost effective processes for generating queries to a data base management system. In today's world of Relational Data Base Management Systems (RDBMS), data bases can store objects and such objects can invoke other objects. Processes for invoking such objects involve invoking procedures which may themselves invoke other procedures to several levels. This nested complexity makes the debugging and testing of such objects very time consuming and machine inefficient.
In the past, many attempts have been made to automate the process of generating the complete dependencies of programs and to use it for compiling and debugging code. One such attempt, involved binding together pre-compiled subroutines to form a complete host procedure object code, as described in US
Patent No. 4,330,822 titled "Recursive System and Method for Binding Compiled Routines". Another such attempt, involved reducing the compilation time of modules using one level of module dependencies, as described in US Patent No.
DBMS PROCEDURES
CROSS-REFERENCE TO RELATED APPLICATIONS
This application is related to application serial number entitled "METHOD AND APPARATUS FOR EXECUTING STORED CODE
OBJECTS IN A DATABASE," filed December 22, 1998.
TECHNICAL FIELD
The invention relates to the field of computer-related systems and methods.
More specifically, the invention is a system and method for automatically generating complete dependency information of DBMS Stored code objects.
BACKGROUND ART
It is desirable to provide efficient and cost effective processes for generating queries to a data base management system. In today's world of Relational Data Base Management Systems (RDBMS), data bases can store objects and such objects can invoke other objects. Processes for invoking such objects involve invoking procedures which may themselves invoke other procedures to several levels. This nested complexity makes the debugging and testing of such objects very time consuming and machine inefficient.
In the past, many attempts have been made to automate the process of generating the complete dependencies of programs and to use it for compiling and debugging code. One such attempt, involved binding together pre-compiled subroutines to form a complete host procedure object code, as described in US
Patent No. 4,330,822 titled "Recursive System and Method for Binding Compiled Routines". Another such attempt, involved reducing the compilation time of modules using one level of module dependencies, as described in US Patent No.
5,586,328 titled "Module Dependency based Incremental Compiler and Method."
Yet another attempt, involved generating complementary source code to resolve external dependencies of program units to facilitate unit testing, as described in US
Patent No. 6,651,111 titled "Method and Apparatus for producing a software test system using complementary code to resolve external dependencies". Yet another attempt, involved building an object oriented software program using compiler generated direct dependency information described in US Patent No. 5,758,160 titled "Method and apparatus for building a software program using dependencies derived from software component interfaces". In all of these cases only the direct dependencies of the modules concerned are used. In a database programming environment, spending an inordinate amount of time finding the dependencies of program units using a compiler is undesirable, since that information is directly available from the database catalog. Many other US patents describe various debugging and testing systems but none of these which is known to Applicant provides the method and system of the present invention for automatically generating the complete dependencies necessary to debug code objects.
It would be advantageous to have a method for automatically generating debug versions of a subprogram and all its dependencies. The method should allow fixing coding errors much faster by eliminating the need for generating debug versions of all dependent subprograms in a manual fashion. The method should also allow detecting potential runtime errors, before the subprogram is debugged or executed. This would allow the elimination of some of the run time errors that can be very hard to detect in a production environment. The method should also allow programmers to visualize a graphic representation of the complete dependencies of subprograms. The method should also allow programmers to visualize INVALID
database objects in the dependency graph. The method should also allow visually identifying cyclic dependencies. This would eliminate the need for programme spending time figuring out the actual dependencies, the nature of such dependencies WO 00/41100 PCT/iJS00/00276 and the validity of such dependent objects. This process involves a combination of browsing the source code and looking up the database catalog for specific dependency information. This manual process can be exhaustive, since multiple levels of dependencies are prevalent in database development environments.
For example, the technical problem can be appreciated with the following additional information:
PL/SQL is a complex language, that allows complex interdependent code to be developed. Code modules in PL/SQL can reside in separate library units that reference one another. There are four main types of library units:
1. Packages are true libraries that can include one or more stored procedures and one or more functions. Each of those objects can be public or private. Public objects (exposed in the package spec) can be invoked from other library units. Private objects can be invoked internally within the package. Each object (procedure or function) can invoke other objects within the package or external to it.
2. Stored procedures are stored objects that include only one callable module. Code in a procedure can invoke external objects.
3. Functions are stored objects that include only one Callable module. Code in a function can invoke external objects. Functions differ from procedures by returning a value.
Yet another attempt, involved generating complementary source code to resolve external dependencies of program units to facilitate unit testing, as described in US
Patent No. 6,651,111 titled "Method and Apparatus for producing a software test system using complementary code to resolve external dependencies". Yet another attempt, involved building an object oriented software program using compiler generated direct dependency information described in US Patent No. 5,758,160 titled "Method and apparatus for building a software program using dependencies derived from software component interfaces". In all of these cases only the direct dependencies of the modules concerned are used. In a database programming environment, spending an inordinate amount of time finding the dependencies of program units using a compiler is undesirable, since that information is directly available from the database catalog. Many other US patents describe various debugging and testing systems but none of these which is known to Applicant provides the method and system of the present invention for automatically generating the complete dependencies necessary to debug code objects.
It would be advantageous to have a method for automatically generating debug versions of a subprogram and all its dependencies. The method should allow fixing coding errors much faster by eliminating the need for generating debug versions of all dependent subprograms in a manual fashion. The method should also allow detecting potential runtime errors, before the subprogram is debugged or executed. This would allow the elimination of some of the run time errors that can be very hard to detect in a production environment. The method should also allow programmers to visualize a graphic representation of the complete dependencies of subprograms. The method should also allow programmers to visualize INVALID
database objects in the dependency graph. The method should also allow visually identifying cyclic dependencies. This would eliminate the need for programme spending time figuring out the actual dependencies, the nature of such dependencies WO 00/41100 PCT/iJS00/00276 and the validity of such dependent objects. This process involves a combination of browsing the source code and looking up the database catalog for specific dependency information. This manual process can be exhaustive, since multiple levels of dependencies are prevalent in database development environments.
For example, the technical problem can be appreciated with the following additional information:
PL/SQL is a complex language, that allows complex interdependent code to be developed. Code modules in PL/SQL can reside in separate library units that reference one another. There are four main types of library units:
1. Packages are true libraries that can include one or more stored procedures and one or more functions. Each of those objects can be public or private. Public objects (exposed in the package spec) can be invoked from other library units. Private objects can be invoked internally within the package. Each object (procedure or function) can invoke other objects within the package or external to it.
2. Stored procedures are stored objects that include only one callable module. Code in a procedure can invoke external objects.
3. Functions are stored objects that include only one Callable module. Code in a function can invoke external objects. Functions differ from procedures by returning a value.
4. Triggers are stored objects that are fired by the database engine when various events occur. Triggers can invoke external obj ects.
OracleBTM also has Types which are abstract data types that can hold data members and member functions.
The debug process involves an object and all its dependencies. If a logical problem exists with a value returned or set by a called object, then the coding erro might exist in either the called object itself, or one of the called objects.
A true debugger should let the developer step through the code traversing dependencies at will, without any special effort. The level of complexity in large applications can easily reach 5 to 10 levels of dependency and the dependency tree can include hundreds of objects.
The alternative for the debugger automatically detecting all the dependencies is for the user to manually analyze the dependencies for the objects and then perform a process that alters all those objects to debug mode, so that they can be debugged. In the example mentioned above, with hundreds of dependent objects this process is tedious and time-consuming.
Alternatively, users can compile all their objects in debug mode, but this again is not optimal, since upon completion of the debug phase they will have to re-compile everything again (for production). Then, for every bug discovered later, the same process is required.
Some RDBMS try to provide assistance in handling these problems. For example, Oracle provides the 'connect by' clause to generate an implicit tree as the result of SQL query. This method of querying could be applied to provide a partial solution to the problem of generating the complete dependency tree of a stored code object. The method can only provide a partial solution because of the way some of the Oracle code objects behave. Specifically, packages are implemented in Oracle as two distinct code objects -- a package specification and a package body. Applying the 'connect by' clause above will result in a tree that will contain dependencies of all the package specifications in the dependency tree but not of the corresponding package bodies. A variation of the 'connect by' clause that also tracks package body dependencies cannot be constructed because SQL does not provide a way of saying not to connect any fizrther, if a condition is satisfied -- i.e.
to prevent infinite recursion in the dependency tree, it is imperative to support a way by which, if a dependency already occurs in the tree in the parent path;v:6e should not proceed to get the dependency of the object again.
OracleBTM also has Types which are abstract data types that can hold data members and member functions.
The debug process involves an object and all its dependencies. If a logical problem exists with a value returned or set by a called object, then the coding erro might exist in either the called object itself, or one of the called objects.
A true debugger should let the developer step through the code traversing dependencies at will, without any special effort. The level of complexity in large applications can easily reach 5 to 10 levels of dependency and the dependency tree can include hundreds of objects.
The alternative for the debugger automatically detecting all the dependencies is for the user to manually analyze the dependencies for the objects and then perform a process that alters all those objects to debug mode, so that they can be debugged. In the example mentioned above, with hundreds of dependent objects this process is tedious and time-consuming.
Alternatively, users can compile all their objects in debug mode, but this again is not optimal, since upon completion of the debug phase they will have to re-compile everything again (for production). Then, for every bug discovered later, the same process is required.
Some RDBMS try to provide assistance in handling these problems. For example, Oracle provides the 'connect by' clause to generate an implicit tree as the result of SQL query. This method of querying could be applied to provide a partial solution to the problem of generating the complete dependency tree of a stored code object. The method can only provide a partial solution because of the way some of the Oracle code objects behave. Specifically, packages are implemented in Oracle as two distinct code objects -- a package specification and a package body. Applying the 'connect by' clause above will result in a tree that will contain dependencies of all the package specifications in the dependency tree but not of the corresponding package bodies. A variation of the 'connect by' clause that also tracks package body dependencies cannot be constructed because SQL does not provide a way of saying not to connect any fizrther, if a condition is satisfied -- i.e.
to prevent infinite recursion in the dependency tree, it is imperative to support a way by which, if a dependency already occurs in the tree in the parent path;v:6e should not proceed to get the dependency of the object again.
The present invention is an efficient and effective solution to the technical problem of retrieving all object dependencies from obects stored in a RDBMS.
The solution to this technical problem developed by applicants uses a query that is called recursively. An array is used to track the parents so that the graph can be reconstructed. At each step, it is determined whether the dependency already occurs in the graph. If it occurs, the recursion is stopped.
DISCLOSURE OF THE INVENTION
A system, method and database development tool are disclosed for automatically generating the complete dependencies of a stored code object in a database by applying a set of recursive procedures and parsing the source code of the code objects.
Also a method for generating a cyclic graph of dependencies based on the complete dependency information and their relationship with one another is claimed.
Additionally claimed are a method for generating debug versions of stored code objects and all its dependencies. Also claimed is a method for identifying potential run-time errors based on the information about the validity of the dependent code objects. Also claimed is a method for identifying the cyclic dependencies of a database code object. Also claimed is a method of debugging code objects in a database using the complete dependency graph of the particular code object.
Also claimed is a method of developing database programs comprising a computer system and a program code mechanism for automatically generating complete dependencies of stored code objects.
Other embodiments of the present invention will become readily apparent to those skilled in these arts from the following detailed description, wherein is shown and described only the embodiments of the invention by way of illustratio~i of the best mode known at this time for carrying out the invention. The invention is capable of other and dii~erent embodiments some of which may be described for illustrative purposes, and several of the details are capable of modification in various obvious respects, all without departing from the spirit and scope of the present invention.
BRIEF DESCRIPTION OF THE DRAWINGS
The features and advantages of the system and method of the present invention will be apparent from the following description in which:
Figure 1 illustrates a flowchart of the overall flow of a preferred embodiment of the present invention.
Figure 2 illustrates a flowchart showing the general processing flow of the recursive analysis steps of the preferred embodiment.
Figure 3 illustrates a flowchart showing the steps used to incorporate dependencies of package bodies into dependency graph.
Figure 4 and 5 together illustrates a flowchart showing the steps used to incorporate dependencies on database triggers and their dependencies into the dependency graph.
Figure 6 illustrates a flowchart showing the steps involved in getting the dependencies of a code object that does not take into consideration the indirect dependencies such as the dependencies of package bodies and dependencies on triggers.
Figure 7 shows a sample dependency-tracking array, which is the base d~,t~
structure used for storing the data elements of the dependency graph.
_ '7 _ Figure 8 is a sample object tree used for purposes of illustration.
Figure 9 illustrates a representative general purpose computer configuration useable as either a client PC and/or a server in the preferred embodiment of the present invention.
BEST MODE FOR CARRYING OUT THE INVENTION
The present invention provides a method and apparatus for generating the complete dependency graph of a database code object. The ability to debug a code object is a fundamental requirement for a developer. This allows verifying the logic of code objects as they are being developed.
In the following description for purposes of explanation, specific data and configurations are set forth in order to provide a thorough understanding of the present invention. In the presently preferred embodiment the invention is described in terms of an Oracle Integrated development Environment (IDE).
However, it will be apparent to one skilled in these arts that the present invention may be practiced without the specific details, in various Data Base systems such as Sybase, Microsoft SQLServer, UDB, DB2, Informix, etc. In other instances, well-known systems and protocols are shown and described in diagrammatical or block diagram form in order not to obscure the present invention unnecessarily.
ADDITIONAL BACKGROUND INFORMATION
As the data stored in DBMS grows more complex, the SQL queries used to retrieve and/or update the data are growing more complex as well. This has lead to the addition of procedural and object oriented extensions to the standard SQL
language. PL/SQLTM is a transaction processing language that offers procedural acrd object oriented extensions to program agasnst the Oracle database. Other databases _g_ provide similar procedural and object oriented extensions. The increasing complexity of these languages has lead to the development of special debuggers that run the SQL language statements under tight control and allow the developer to interact with and analyze the statements as they are executed.
The combination of interactive debugging with code objects that reside on the server has lead to a problem where the debugger must be configured for the procedure that is being debugged and all its dependent procedures.
Specifically, the 'step into' operation that allows you to step into dependent objects will work only if those code objects are configured to be debugged. So the user either has to identify and configure all procedures that will be used, including procedures called by those procedures or else they give up the full debugging control.
This is a cumbersome process and frequently leads to frustration on the part of the developer.
PL/SQL is a complex language that allows complex inter-dependent code to be developed. Code modules in PL/SQL can reside in separate code objects that reference one another. Code objects in PL/SQL take the form of one of the following:
a) A PL/SQL stored procedure, which is a routine that can take input parameters and return output parameters, b) A PL/SQL stored fiznction, which is a routine that can take input parameters and return output parameters. In addition stored fiznctions can be used in an expression and returns a value of a particular type declared in the specification, c) A PL/SQL stored package specification, which forms the specification for a collection of stored functions and procedures identified as a single named entity, d) A PL/SQL stored package body, which forms the implementation~t-a collection of stored fixnctions and procedures identified as a single entity, _9_ e) A PL/SQL stored type specification(OracleBTM only), which forms the specification for a collection of data elements and member functions identified as a single named entity, f) A PL/SQL stored type body(OracleBTM only), which forms the implementation for a collection of member functions identified as a single entity, g) A PL/SQL stored trigger, which is a routine that gets executed automatically, when a data manipulation statement is executed in the database server and h) An anonymous PL/SQL block, which is an unnamed set of PL/SQL
statements that can be executed on the server.
Databases support object-oriented programming in different ways.
Oracle7TM supports this programming methodology through PL/SQL stored Package Specifications and PL/SQL stored Package Bodies. Although the syntax of such support is different on different databases, the fundamental concept of having a specification which can represent an abstract data type and an implementation which implements the specification is supported in all databases.
(Oracle, Oracle7, Oracle8, and PL/SQL are trademarks of Oracle Corporation).
The debug process involves an object and all its dependencies. If a logical problem exists with a value returned or set by a called object, then the coding error might exist in either the called object, or one of the dependencies of the called objects. A true debugger should let the developer step through the code traversing dependencies at will, without any special effort. The level of complexity in large applications can easily reach S to 10 levels of dependency and the dependency tree can include hundreds of objects.
The alternative for the debugger automatically detecting all the dependencies is for the user to manually analyze the dependencies for the objets and then perform a process that alters all those objects to debug mode, so that they can be debugged. In the example mentioned above, with hundreds of dependent objects this process is tedious and time-consuming.
Alternatively, users can compile all their objects in debug mode, but this again is not optimal, since upon completion of the debug phase they will have to re-compile everything again (for production). Then, for every bug discovered later, the same process is required.
OPERATING ENVIRONMENT
The present invention operates in and as a part of a general purpose computer unit which may include generally some or all of the elements shown in Figure 9, wherein the general purpose system 201 includes a motherboard 203 having thereon an input/output ("I/O") section 205, one or more central processing units ("CPLr') 207, and a memory section 209 which may have a flash memory card 211 related to it. The I/O section 205 is connected to a keyboard 226, other similar general purpose computer units 225, 215, a disk storage unit 223 and a CD-ROM
drive unit 217. The CD-ROM drive unit 217 can read a CD-ROM medium 219 which typically contains programs 221 and other data. Logic circuits or other components of these programmed computers will perform series of specifically identified operations dictated by computer programs as described more fully below.
THE PREFERRED EMBODIMENT
The present invention provides a method and apparatus for generating the complete dependency graph of a stored code object. In a preferred embodiment, the method generates the complete dependency graph of a stored code object in an Oracle database. The method takes into consideration, getting the dependencies of object oriented code objects that have implementations that are separate from specifications. In the preferred embodiment, this involves incorporating tTie dependencies of Package and Type Bodies in addition to the dependencies of Package and Type Specifications. The method also takes into considerations dependencies on database Triggers. Triggers are code objects that are executed automatically as a result of executing a Data Manipulation Statement (DML) that modifies data in a particular table. Other code objects are not directly dependent on triggers. However, an indirect dependency is possible, when the code object executes a DML statement that automatically executes ("fires") the trigger.
The present invention accomplishes this through a process described by the following algorithm:
1. Using a recursive procedure that returns dependencies of procedural code objects and dependencies of specifications of object oriented code objects, based on a query against the database that returns a single level of dependencies.
2. Using the recursive procedure in Step 1 to determine the dependencies of implementations of object oriented code objects, based on a query against the database that returns a single level of dependencies.
3. Using a source code parsing procedure to identify DML statements that can "fire" triggers. Specifically, the parser looks for UPDATE, DELETE and INSERT statements. The parser identifies the type of the statement and also the database table. The algorithm then checks whether a corresponding trigger exists in the database. This identifies the dependencies on triggers of any stored code object. The flowchart in Figures 4 and 5 explains a variation of this algorithm that starts with the dependencies on tables working backward to find the dependencies on triggers.
4. Using the recursive procedure in Step 1 to determine the dependencies of triggers found in Step 3, based on a query against the database that returns a single level of dependencies.
5. Repeating Steps 2 through 4 until there are no new dependencies.
The general flow of the preferred embodiment is now described vdi'~
reference to the Figure 1.
The user interface element component 11 is used to select a code object from the database. The selected code object provides the information required in generating the dependency information. Component 12 is used to generate the complete dependency graph of the selected object. It generates a data structure that holds the complete dependency information hereby termed a tracking array. The tracking array is used by Component 13 to generate a User Interface element that shows the complete dependency graph. Component 14 scans the tracking array and compiles the objects in debug mode. This step ensures transparent "Step Into"
operation from the Debugging facility. If any of the objects that are compiled in debug mode are INVALLD, Component 15 shows the complete dependency graph with INVALID objects highlighted. INVALID objects in the complete dependency graph identifies code paths that can result in runtime errors. This functionality is indispensable for database programmers since otherwise a tremendous amount of time may be spent trying to identify the source of a run-time error. Component scans the dependency array and for each object in the array, checks whether that object is part of a cyclic dependency. A well-known graph traversal algorithm is used for the purpose. Cyclic elements of the graph are then highlighted in a User Interface component that displays the dependency graph. Component 16 uses the tracking array generated in Component 12 and the objects compiled in debug mode to launch the Debugger.
The general technical solution to the problem is now described with reference to Figure 2 through 5.
Component 21 in Figure 2 applies the flowchart in Figure 6 to generate a tracking array of dependent code objects. The array data structure shown in Fig.7 contains all the information necessary to draw a dependency graph. The algorithm does not take into consideration dependencies on triggers as well as dependencies on implementations of object oriented code objects. .As a result, after the in~al y array data is generated in block 21, flow then proceeds to component A 23 which is described below with respect to Figure 3 wherein the dependencies on implementations of object oriented code objects are identified. Then the system flow proceeds to component B 24 which is described in below with respect to Figure 4 wherein any dependencies on triggers are evaluated. After determining that no new nodes were found (component 22) the routine is completed with the array containing all dependencies of the target object.
Referring now to Figure 3, Component 31 selects the next code object starting with the first one in the tracking array. Component 32 checks whether the code object is a Package or a Type. (Packages are defined and described in Chapter 7, Oracle7TM Server Application developers Guide, which is hereby incorporated fully herein by reference. Types are defined and described in Oracle8 SQL
Reference, Release 8.0, which is hereby incorporated fully herein by reference). If it is a package or type, Component 33 applies the flowchart in Figure 6 again to incorporate the dependencies of the package body or the type body respectively into the tracking array. Component 34 then checks whether this is the last object in the tracking array.
Component 41 in Figure 4 selects the next code object starting with the first one in the tracking array. Component 42 gets the dependencies on database tables of the code object using a database query against the catalog. Component 43 selects the next database table dependency starting with the first one. Component 44 gets the dependencies on database triggers of the database table. (Triggers are defined and described in Chapter 8, Oracle7TM Server Application developers Guide, which is hereby incorporated fully herein by reference). Component 45 selects the next database trigger dependency starting with the first one. Component 46 parses the source code of the code object to verify whether a Data Manipulation Statement (DML) that "fires" the trigger is present in the source code. If such a statement is present, component 52 in Figure 5 applies the flowchart in Figure 6 again"t8 incorporate the dependencies of the trigger into the tracking array. Component in Figure S checks whether this is the last trigger dependency. If No, Control returns to Component 45 in Figure 4 that selects the next trigger dependency.
If Yes, Component 54 in Figure 5 checks whether this is the last table dependency. If No, Control returns to Component 43 in Figure 4 that selects the next database table dependency. If Yes, Control shifts to Component 22 in Figure 2 that checks whether a new node was added during application of the algorithms in Figures 3 and 4. If No, the algorithm terminates and the tracking array contains the complete dependency information of the selected code object.
A more detailed description of the basic recursive process is now described with reference to Figure 6 and Figure 7.
The current code object is passed in as an argument to the algorithm in Figure 6. Component 61 in Figure 6 adds the current code object as a new item in the tracking array. A sample item in a tracking array is depicted in Figure 7.
As illustrated, the tracking array consists of the following elements - the object id number 71 that uniquely identifies the object in the database, the object name 72, the owner of the object 73, a flag indicating whether the object is residing in the current database 74, the type of the object 75 and a variable number of child object ids 76. The child object ids 76 track the direct dependencies of a particular code object. Referring again to Figure 6, Component 62 queries the database catalog to get the direct dependencies of the current object. Component 63 then gets the next direct dependency starting with the first one. Component 64 checks whether a dependency was found in Component 63. If none was found, the algorithm terminates. If one was found, Component 65 then updates the tracking array element of the current object to contain this dependency. This is done by adding the object id of the dependent object as a child object id in to the tracking array element ofthe current object. Component 66 then checks whether this dependent object is already present in the tracking array. If Yes, Control shifts to component 63 whic~5 gets the next direct dependency. IfNo, the algorithm is recursively called by passing in this dependent object as the argument.
An example, which depicts a typical object and its dependency analysis, is now described with reference to Figure 8.
Following is an example of a typical stored function:
1. create or replace function CheckGender return number 2. as 3. begin 4. prod;
5. proc2;
6. proc3;
7. end;
The solution to this technical problem developed by applicants uses a query that is called recursively. An array is used to track the parents so that the graph can be reconstructed. At each step, it is determined whether the dependency already occurs in the graph. If it occurs, the recursion is stopped.
DISCLOSURE OF THE INVENTION
A system, method and database development tool are disclosed for automatically generating the complete dependencies of a stored code object in a database by applying a set of recursive procedures and parsing the source code of the code objects.
Also a method for generating a cyclic graph of dependencies based on the complete dependency information and their relationship with one another is claimed.
Additionally claimed are a method for generating debug versions of stored code objects and all its dependencies. Also claimed is a method for identifying potential run-time errors based on the information about the validity of the dependent code objects. Also claimed is a method for identifying the cyclic dependencies of a database code object. Also claimed is a method of debugging code objects in a database using the complete dependency graph of the particular code object.
Also claimed is a method of developing database programs comprising a computer system and a program code mechanism for automatically generating complete dependencies of stored code objects.
Other embodiments of the present invention will become readily apparent to those skilled in these arts from the following detailed description, wherein is shown and described only the embodiments of the invention by way of illustratio~i of the best mode known at this time for carrying out the invention. The invention is capable of other and dii~erent embodiments some of which may be described for illustrative purposes, and several of the details are capable of modification in various obvious respects, all without departing from the spirit and scope of the present invention.
BRIEF DESCRIPTION OF THE DRAWINGS
The features and advantages of the system and method of the present invention will be apparent from the following description in which:
Figure 1 illustrates a flowchart of the overall flow of a preferred embodiment of the present invention.
Figure 2 illustrates a flowchart showing the general processing flow of the recursive analysis steps of the preferred embodiment.
Figure 3 illustrates a flowchart showing the steps used to incorporate dependencies of package bodies into dependency graph.
Figure 4 and 5 together illustrates a flowchart showing the steps used to incorporate dependencies on database triggers and their dependencies into the dependency graph.
Figure 6 illustrates a flowchart showing the steps involved in getting the dependencies of a code object that does not take into consideration the indirect dependencies such as the dependencies of package bodies and dependencies on triggers.
Figure 7 shows a sample dependency-tracking array, which is the base d~,t~
structure used for storing the data elements of the dependency graph.
_ '7 _ Figure 8 is a sample object tree used for purposes of illustration.
Figure 9 illustrates a representative general purpose computer configuration useable as either a client PC and/or a server in the preferred embodiment of the present invention.
BEST MODE FOR CARRYING OUT THE INVENTION
The present invention provides a method and apparatus for generating the complete dependency graph of a database code object. The ability to debug a code object is a fundamental requirement for a developer. This allows verifying the logic of code objects as they are being developed.
In the following description for purposes of explanation, specific data and configurations are set forth in order to provide a thorough understanding of the present invention. In the presently preferred embodiment the invention is described in terms of an Oracle Integrated development Environment (IDE).
However, it will be apparent to one skilled in these arts that the present invention may be practiced without the specific details, in various Data Base systems such as Sybase, Microsoft SQLServer, UDB, DB2, Informix, etc. In other instances, well-known systems and protocols are shown and described in diagrammatical or block diagram form in order not to obscure the present invention unnecessarily.
ADDITIONAL BACKGROUND INFORMATION
As the data stored in DBMS grows more complex, the SQL queries used to retrieve and/or update the data are growing more complex as well. This has lead to the addition of procedural and object oriented extensions to the standard SQL
language. PL/SQLTM is a transaction processing language that offers procedural acrd object oriented extensions to program agasnst the Oracle database. Other databases _g_ provide similar procedural and object oriented extensions. The increasing complexity of these languages has lead to the development of special debuggers that run the SQL language statements under tight control and allow the developer to interact with and analyze the statements as they are executed.
The combination of interactive debugging with code objects that reside on the server has lead to a problem where the debugger must be configured for the procedure that is being debugged and all its dependent procedures.
Specifically, the 'step into' operation that allows you to step into dependent objects will work only if those code objects are configured to be debugged. So the user either has to identify and configure all procedures that will be used, including procedures called by those procedures or else they give up the full debugging control.
This is a cumbersome process and frequently leads to frustration on the part of the developer.
PL/SQL is a complex language that allows complex inter-dependent code to be developed. Code modules in PL/SQL can reside in separate code objects that reference one another. Code objects in PL/SQL take the form of one of the following:
a) A PL/SQL stored procedure, which is a routine that can take input parameters and return output parameters, b) A PL/SQL stored fiznction, which is a routine that can take input parameters and return output parameters. In addition stored fiznctions can be used in an expression and returns a value of a particular type declared in the specification, c) A PL/SQL stored package specification, which forms the specification for a collection of stored functions and procedures identified as a single named entity, d) A PL/SQL stored package body, which forms the implementation~t-a collection of stored fixnctions and procedures identified as a single entity, _9_ e) A PL/SQL stored type specification(OracleBTM only), which forms the specification for a collection of data elements and member functions identified as a single named entity, f) A PL/SQL stored type body(OracleBTM only), which forms the implementation for a collection of member functions identified as a single entity, g) A PL/SQL stored trigger, which is a routine that gets executed automatically, when a data manipulation statement is executed in the database server and h) An anonymous PL/SQL block, which is an unnamed set of PL/SQL
statements that can be executed on the server.
Databases support object-oriented programming in different ways.
Oracle7TM supports this programming methodology through PL/SQL stored Package Specifications and PL/SQL stored Package Bodies. Although the syntax of such support is different on different databases, the fundamental concept of having a specification which can represent an abstract data type and an implementation which implements the specification is supported in all databases.
(Oracle, Oracle7, Oracle8, and PL/SQL are trademarks of Oracle Corporation).
The debug process involves an object and all its dependencies. If a logical problem exists with a value returned or set by a called object, then the coding error might exist in either the called object, or one of the dependencies of the called objects. A true debugger should let the developer step through the code traversing dependencies at will, without any special effort. The level of complexity in large applications can easily reach S to 10 levels of dependency and the dependency tree can include hundreds of objects.
The alternative for the debugger automatically detecting all the dependencies is for the user to manually analyze the dependencies for the objets and then perform a process that alters all those objects to debug mode, so that they can be debugged. In the example mentioned above, with hundreds of dependent objects this process is tedious and time-consuming.
Alternatively, users can compile all their objects in debug mode, but this again is not optimal, since upon completion of the debug phase they will have to re-compile everything again (for production). Then, for every bug discovered later, the same process is required.
OPERATING ENVIRONMENT
The present invention operates in and as a part of a general purpose computer unit which may include generally some or all of the elements shown in Figure 9, wherein the general purpose system 201 includes a motherboard 203 having thereon an input/output ("I/O") section 205, one or more central processing units ("CPLr') 207, and a memory section 209 which may have a flash memory card 211 related to it. The I/O section 205 is connected to a keyboard 226, other similar general purpose computer units 225, 215, a disk storage unit 223 and a CD-ROM
drive unit 217. The CD-ROM drive unit 217 can read a CD-ROM medium 219 which typically contains programs 221 and other data. Logic circuits or other components of these programmed computers will perform series of specifically identified operations dictated by computer programs as described more fully below.
THE PREFERRED EMBODIMENT
The present invention provides a method and apparatus for generating the complete dependency graph of a stored code object. In a preferred embodiment, the method generates the complete dependency graph of a stored code object in an Oracle database. The method takes into consideration, getting the dependencies of object oriented code objects that have implementations that are separate from specifications. In the preferred embodiment, this involves incorporating tTie dependencies of Package and Type Bodies in addition to the dependencies of Package and Type Specifications. The method also takes into considerations dependencies on database Triggers. Triggers are code objects that are executed automatically as a result of executing a Data Manipulation Statement (DML) that modifies data in a particular table. Other code objects are not directly dependent on triggers. However, an indirect dependency is possible, when the code object executes a DML statement that automatically executes ("fires") the trigger.
The present invention accomplishes this through a process described by the following algorithm:
1. Using a recursive procedure that returns dependencies of procedural code objects and dependencies of specifications of object oriented code objects, based on a query against the database that returns a single level of dependencies.
2. Using the recursive procedure in Step 1 to determine the dependencies of implementations of object oriented code objects, based on a query against the database that returns a single level of dependencies.
3. Using a source code parsing procedure to identify DML statements that can "fire" triggers. Specifically, the parser looks for UPDATE, DELETE and INSERT statements. The parser identifies the type of the statement and also the database table. The algorithm then checks whether a corresponding trigger exists in the database. This identifies the dependencies on triggers of any stored code object. The flowchart in Figures 4 and 5 explains a variation of this algorithm that starts with the dependencies on tables working backward to find the dependencies on triggers.
4. Using the recursive procedure in Step 1 to determine the dependencies of triggers found in Step 3, based on a query against the database that returns a single level of dependencies.
5. Repeating Steps 2 through 4 until there are no new dependencies.
The general flow of the preferred embodiment is now described vdi'~
reference to the Figure 1.
The user interface element component 11 is used to select a code object from the database. The selected code object provides the information required in generating the dependency information. Component 12 is used to generate the complete dependency graph of the selected object. It generates a data structure that holds the complete dependency information hereby termed a tracking array. The tracking array is used by Component 13 to generate a User Interface element that shows the complete dependency graph. Component 14 scans the tracking array and compiles the objects in debug mode. This step ensures transparent "Step Into"
operation from the Debugging facility. If any of the objects that are compiled in debug mode are INVALLD, Component 15 shows the complete dependency graph with INVALID objects highlighted. INVALID objects in the complete dependency graph identifies code paths that can result in runtime errors. This functionality is indispensable for database programmers since otherwise a tremendous amount of time may be spent trying to identify the source of a run-time error. Component scans the dependency array and for each object in the array, checks whether that object is part of a cyclic dependency. A well-known graph traversal algorithm is used for the purpose. Cyclic elements of the graph are then highlighted in a User Interface component that displays the dependency graph. Component 16 uses the tracking array generated in Component 12 and the objects compiled in debug mode to launch the Debugger.
The general technical solution to the problem is now described with reference to Figure 2 through 5.
Component 21 in Figure 2 applies the flowchart in Figure 6 to generate a tracking array of dependent code objects. The array data structure shown in Fig.7 contains all the information necessary to draw a dependency graph. The algorithm does not take into consideration dependencies on triggers as well as dependencies on implementations of object oriented code objects. .As a result, after the in~al y array data is generated in block 21, flow then proceeds to component A 23 which is described below with respect to Figure 3 wherein the dependencies on implementations of object oriented code objects are identified. Then the system flow proceeds to component B 24 which is described in below with respect to Figure 4 wherein any dependencies on triggers are evaluated. After determining that no new nodes were found (component 22) the routine is completed with the array containing all dependencies of the target object.
Referring now to Figure 3, Component 31 selects the next code object starting with the first one in the tracking array. Component 32 checks whether the code object is a Package or a Type. (Packages are defined and described in Chapter 7, Oracle7TM Server Application developers Guide, which is hereby incorporated fully herein by reference. Types are defined and described in Oracle8 SQL
Reference, Release 8.0, which is hereby incorporated fully herein by reference). If it is a package or type, Component 33 applies the flowchart in Figure 6 again to incorporate the dependencies of the package body or the type body respectively into the tracking array. Component 34 then checks whether this is the last object in the tracking array.
Component 41 in Figure 4 selects the next code object starting with the first one in the tracking array. Component 42 gets the dependencies on database tables of the code object using a database query against the catalog. Component 43 selects the next database table dependency starting with the first one. Component 44 gets the dependencies on database triggers of the database table. (Triggers are defined and described in Chapter 8, Oracle7TM Server Application developers Guide, which is hereby incorporated fully herein by reference). Component 45 selects the next database trigger dependency starting with the first one. Component 46 parses the source code of the code object to verify whether a Data Manipulation Statement (DML) that "fires" the trigger is present in the source code. If such a statement is present, component 52 in Figure 5 applies the flowchart in Figure 6 again"t8 incorporate the dependencies of the trigger into the tracking array. Component in Figure S checks whether this is the last trigger dependency. If No, Control returns to Component 45 in Figure 4 that selects the next trigger dependency.
If Yes, Component 54 in Figure 5 checks whether this is the last table dependency. If No, Control returns to Component 43 in Figure 4 that selects the next database table dependency. If Yes, Control shifts to Component 22 in Figure 2 that checks whether a new node was added during application of the algorithms in Figures 3 and 4. If No, the algorithm terminates and the tracking array contains the complete dependency information of the selected code object.
A more detailed description of the basic recursive process is now described with reference to Figure 6 and Figure 7.
The current code object is passed in as an argument to the algorithm in Figure 6. Component 61 in Figure 6 adds the current code object as a new item in the tracking array. A sample item in a tracking array is depicted in Figure 7.
As illustrated, the tracking array consists of the following elements - the object id number 71 that uniquely identifies the object in the database, the object name 72, the owner of the object 73, a flag indicating whether the object is residing in the current database 74, the type of the object 75 and a variable number of child object ids 76. The child object ids 76 track the direct dependencies of a particular code object. Referring again to Figure 6, Component 62 queries the database catalog to get the direct dependencies of the current object. Component 63 then gets the next direct dependency starting with the first one. Component 64 checks whether a dependency was found in Component 63. If none was found, the algorithm terminates. If one was found, Component 65 then updates the tracking array element of the current object to contain this dependency. This is done by adding the object id of the dependent object as a child object id in to the tracking array element ofthe current object. Component 66 then checks whether this dependent object is already present in the tracking array. If Yes, Control shifts to component 63 whic~5 gets the next direct dependency. IfNo, the algorithm is recursively called by passing in this dependent object as the argument.
An example, which depicts a typical object and its dependency analysis, is now described with reference to Figure 8.
Following is an example of a typical stored function:
1. create or replace function CheckGender return number 2. as 3. begin 4. prod;
5. proc2;
6. proc3;
7. end;
8. /
The function is depicted as the node with 'id=1' in Figure 8. The function has direct dependencies on 3 procedures 'procl', 'proc2' and 'proc3' depicted in Figure 8 as the nodes with 'id=2', 'id=3' and 'id=4' respectively. The procedure 'proc2' does not have any dependencies. The procedure 'proc3' has a dependency on a procedure 'proc6' depicted in Figure 8 as the node with 'id=10'. For illustrative purposes, the source code of 'procl' is shown below:
1. create or replace procedure prod as 2. begin 3. proc4;
4. insert into tablel values (1);
5. proc5;
6. end;
7. /
The procedure 'prod' has direct dependencies on procedure 'proc4'~d 'proc5' depicted in Figure 8 as nodes with 'id=5' and 'id=7'. The procedure also WO 00/41100 PCT/iJS00/00276 has a Data Manipulation Statement (DML) that fires an insert trigger 'trigl' depicted as the node with 'id=6' in Figure 8. The trigger 'trigl' in turn has dependencies on procedures 'proc3' and 'proc7' depicted in Figure 8 as the nodes with 'id=4' and 'id=8' respectively. The trigger 'trigl' also has a dependency on a S stored package 'packl' depicted in Figure 8 as the node with 'id=9'. The specification of 'packl' does not have any dependencies. However, the body of 'packl' has a dependency on procedure 'prod' depicted in Figure 8 as the node with 'id=2' .
In this example, the algorithm works as follows: Applying the algorithm depicted in Figure 6 (the first step in the algorithm in Figure 2) yields the basic dependency graph consisting of objects with ids 1, 2, 3, 4, 5, 7 and 10. The tracking array now has 7 items. Item 1 has object id 1 and has entries 2, 3 and 4 as child object ids. Item 2 has object id 2 and has entries 5 and 7 as child object ids. Item 3 has object id 3 and has no child objects. Item 4 has object id 4 and has entry 10 as the only child object id. Item 5 has object id 5 and has no child objects.
Item 6 has object id 7 and has no child object ids. Item 7 has object id 10 and has no child object ids. Notice that the dependency of 'prod' (id=2) on the trigger 'trigl' (id=6) is not incorporated yet. The dependencies of the trigger 'trigl' are also not incorporated yet. Applying the algorithm in Figure 3 then yields the exact same graph with no changes. Applying the algorithm in Figure 4 and 5 then yields a dependency graph that includes all the nodes in the complete dependency graph.
Item 2 now has id 6 as an additional child object. The tracking array now has items. Item 8 has object id 6 and has entries 8, 9 and 4 as child object ids.
Item 9 has object id 8 and has no child object ids. Item 10 has object id 9 and has no child object ids. However, the dependency of the body of package 'packl' (id=9) on the procedure 'prod' (id=2) is not yet incorporated in the dependency graph. We then apply the algorithms in Figures 3 through S again, since the condition in compon~
22 in Figure 2 evaluates to 'Yes' - Nodes with ids 6, 8 and 9 were added when we applied the algorithms in Figures 3 through S. Applying algorithm in Figure 3 yields the complete dependency graph - the dependency of the package body of 'packl' (id=9) on the procedure 'procl' (id=2) is added during this step. Item 10 in the tracking array now has a child object id 2. Applying the algorithm in Figure 4 and 5 does not change the dependency graph. The condition in component 22 in Figure 2 now evaluates to 'No', since no new nodes were added. The algorithm in Figure 2 terminates. The tracking array now holds the information needed to generate a complete dependency graph. The tracking array is then scanned to generate the debug versions of all objects in the dependency graph. If any of the objects so compiled is INVALID, such objects are highlighted in the generated dependency graph. For each object in the tracking array a well-known graph traversal algorithm is applied to identify whether they are part of a cyclic dependency. Such cyclic paths in the graph are then highlighted. In the present example object ids 2, 6 and 9 form a cyclic path and so those nodes and the paths are highlighted. This identifies a potential infinite loop at runtime. The graph identifies the possibility that, when the trigger 'trigl' (id=6) fires and the package body code gets executed, the package body of 'packl' (id=9) may in turn call the procedure 'procl' (id=2) thereby resulting in a potential infinite loop.
Having described the invention in terms of a preferred embodiment, it will be recognized by those skilled in the art that various types of general purpose computer hardware may be substituted for the configuration described above to achieve an equivalent result. Similarly, it will be appreciated that arithmetic logic circuits are configured to perform each required means in the claims for processing Internet security protocols and tunneling protocols; for permitting the master unit to adaptively distribute processing assignments for incoming messages and for permitting cluster members to recognize which messages are theirs to process;
and for recognizing messages from other members in the cluster. It will be apparen~o those skilled in the art that modifications and variations of the preferred embodiment are possible, which fall within the true spirit and scope of the invention as measured by the following claims.
The function is depicted as the node with 'id=1' in Figure 8. The function has direct dependencies on 3 procedures 'procl', 'proc2' and 'proc3' depicted in Figure 8 as the nodes with 'id=2', 'id=3' and 'id=4' respectively. The procedure 'proc2' does not have any dependencies. The procedure 'proc3' has a dependency on a procedure 'proc6' depicted in Figure 8 as the node with 'id=10'. For illustrative purposes, the source code of 'procl' is shown below:
1. create or replace procedure prod as 2. begin 3. proc4;
4. insert into tablel values (1);
5. proc5;
6. end;
7. /
The procedure 'prod' has direct dependencies on procedure 'proc4'~d 'proc5' depicted in Figure 8 as nodes with 'id=5' and 'id=7'. The procedure also WO 00/41100 PCT/iJS00/00276 has a Data Manipulation Statement (DML) that fires an insert trigger 'trigl' depicted as the node with 'id=6' in Figure 8. The trigger 'trigl' in turn has dependencies on procedures 'proc3' and 'proc7' depicted in Figure 8 as the nodes with 'id=4' and 'id=8' respectively. The trigger 'trigl' also has a dependency on a S stored package 'packl' depicted in Figure 8 as the node with 'id=9'. The specification of 'packl' does not have any dependencies. However, the body of 'packl' has a dependency on procedure 'prod' depicted in Figure 8 as the node with 'id=2' .
In this example, the algorithm works as follows: Applying the algorithm depicted in Figure 6 (the first step in the algorithm in Figure 2) yields the basic dependency graph consisting of objects with ids 1, 2, 3, 4, 5, 7 and 10. The tracking array now has 7 items. Item 1 has object id 1 and has entries 2, 3 and 4 as child object ids. Item 2 has object id 2 and has entries 5 and 7 as child object ids. Item 3 has object id 3 and has no child objects. Item 4 has object id 4 and has entry 10 as the only child object id. Item 5 has object id 5 and has no child objects.
Item 6 has object id 7 and has no child object ids. Item 7 has object id 10 and has no child object ids. Notice that the dependency of 'prod' (id=2) on the trigger 'trigl' (id=6) is not incorporated yet. The dependencies of the trigger 'trigl' are also not incorporated yet. Applying the algorithm in Figure 3 then yields the exact same graph with no changes. Applying the algorithm in Figure 4 and 5 then yields a dependency graph that includes all the nodes in the complete dependency graph.
Item 2 now has id 6 as an additional child object. The tracking array now has items. Item 8 has object id 6 and has entries 8, 9 and 4 as child object ids.
Item 9 has object id 8 and has no child object ids. Item 10 has object id 9 and has no child object ids. However, the dependency of the body of package 'packl' (id=9) on the procedure 'prod' (id=2) is not yet incorporated in the dependency graph. We then apply the algorithms in Figures 3 through S again, since the condition in compon~
22 in Figure 2 evaluates to 'Yes' - Nodes with ids 6, 8 and 9 were added when we applied the algorithms in Figures 3 through S. Applying algorithm in Figure 3 yields the complete dependency graph - the dependency of the package body of 'packl' (id=9) on the procedure 'procl' (id=2) is added during this step. Item 10 in the tracking array now has a child object id 2. Applying the algorithm in Figure 4 and 5 does not change the dependency graph. The condition in component 22 in Figure 2 now evaluates to 'No', since no new nodes were added. The algorithm in Figure 2 terminates. The tracking array now holds the information needed to generate a complete dependency graph. The tracking array is then scanned to generate the debug versions of all objects in the dependency graph. If any of the objects so compiled is INVALID, such objects are highlighted in the generated dependency graph. For each object in the tracking array a well-known graph traversal algorithm is applied to identify whether they are part of a cyclic dependency. Such cyclic paths in the graph are then highlighted. In the present example object ids 2, 6 and 9 form a cyclic path and so those nodes and the paths are highlighted. This identifies a potential infinite loop at runtime. The graph identifies the possibility that, when the trigger 'trigl' (id=6) fires and the package body code gets executed, the package body of 'packl' (id=9) may in turn call the procedure 'procl' (id=2) thereby resulting in a potential infinite loop.
Having described the invention in terms of a preferred embodiment, it will be recognized by those skilled in the art that various types of general purpose computer hardware may be substituted for the configuration described above to achieve an equivalent result. Similarly, it will be appreciated that arithmetic logic circuits are configured to perform each required means in the claims for processing Internet security protocols and tunneling protocols; for permitting the master unit to adaptively distribute processing assignments for incoming messages and for permitting cluster members to recognize which messages are theirs to process;
and for recognizing messages from other members in the cluster. It will be apparen~o those skilled in the art that modifications and variations of the preferred embodiment are possible, which fall within the true spirit and scope of the invention as measured by the following claims.
Claims (30)
1) A method of automatically generating a complete dependency graph of a database code object, using a computer which has a processor, memory, display, input/output devices and connectivity software to connect to a database server, the method comprising the steps of:
applying a recursive algorithm that queries a database for dependency information and outputs a direct dependency graph of a database code object, the "direct dependency graph" containing dependencies representing dependencies that do not involve dependencies on triggers and on implementations of object-oriented code objects in the database;
applying the recursive algorithm on each of the object-oriented code objects in the dependency graph to incorporate dependencies of implementations of code objects in the database;
using a parser on each of the code objects in the dependency graph to identify DML statements that "fires" triggers thereby identifying dependencies on triggers;
applying the recursive algorithm on each of the triggers to incorporate the dependencies of the triggers into the dependency graph; and repeating the procedure for incorporating dependencies of implementation of object oriented code objects as well as the dependencies on triggers and its dependencies until new dependencies are not added to the dependency graph.
applying a recursive algorithm that queries a database for dependency information and outputs a direct dependency graph of a database code object, the "direct dependency graph" containing dependencies representing dependencies that do not involve dependencies on triggers and on implementations of object-oriented code objects in the database;
applying the recursive algorithm on each of the object-oriented code objects in the dependency graph to incorporate dependencies of implementations of code objects in the database;
using a parser on each of the code objects in the dependency graph to identify DML statements that "fires" triggers thereby identifying dependencies on triggers;
applying the recursive algorithm on each of the triggers to incorporate the dependencies of the triggers into the dependency graph; and repeating the procedure for incorporating dependencies of implementation of object oriented code objects as well as the dependencies on triggers and its dependencies until new dependencies are not added to the dependency graph.
2) The method of claim 1 comprizing the additional step of using the generated dependency graph to compile code objects in debug mode as part of a database code object debugging tool.
3) The method of claim 1 comprizing the additional step of using the generated dependency graph to identify calling paths in a database code coverage tool.
4) The method of claim 1 comprizing the additional step of using the generated dependency graph to identify calling paths in a database code object profiling tool.
5) The method of claim 1 comprizing the additional step of using the generated dependency graph in a database code object testing tool.
6) The method of claim 1 comprizing the additional step of using the generated dependency graph to identify dependent objects that are INVALID in the database.
7) The method of claim 1 comprizing the additional step of using the generated dependency graph to identify cyclic dependencies among database code objects.
8) The method of claim 1 comprizing the additional step of using the generated dependency graph in a dependency graph presentation tool.
9) A method of generating a basic dependency tree of a code object that does not take into consideration dependencies on triggers and on implementations of object-oriented code objects, the method comprising the steps of:
querying a database catalog for direct dependencies of a code object and then for each dependency found, doing the query recursively until all basic dependencies are generated into a dependency tree.
querying a database catalog for direct dependencies of a code object and then for each dependency found, doing the query recursively until all basic dependencies are generated into a dependency tree.
10) The method of claim 9 comprizing the additional step of using the generated dependency tree to compile code objects in debug mode as part of a database code object debugging tool.
11) The method of claim 9 comprizing the additional step of using the generated dependency tree to identify calling paths in a database code coverage tool.
12) The method of claim 9 comprizing the additional step of using the generated dependency tree to identify calling paths in a database code object profiling tool.
13) The method of claim 9 comprizing the additional step of using the generated dependency tree in a database code object testing tool.
14) The method of claim 9 comprizing the additional step of using the generated dependency tree to identify dependent objects that are INVALID in the database.
15) The method of claim 9 comprizing the additional step of using the generated dependency tree to identify cyclic dependencies among database code objects.
16) The method of claim 9 comprizing the additional step of using the generated dependency tree in a dependency graph presentation tool.
17) A method of generating dependency information including dependencies of code objects on database triggers, the method comprising the steps of:
1) using a recursive algorithm for querying a database catalog for direct dependencies of a code object and then for each dependency found, doing the query recursively until all basic dependencies are generated into a dependency graph;
2) using a parser on each of the code objects in the dependency graph to identify DML statements that "fires" triggers thereby identifying dependencies on triggers;
3) applying the recursive algorithm on each of the triggers to incorporate the dependencies of the triggers into the dependency graph; and 4) repeating steps 1-3 for incorporating dependencies on triggers and their dependencies until new dependencies are not added to the dependency graph.
1) using a recursive algorithm for querying a database catalog for direct dependencies of a code object and then for each dependency found, doing the query recursively until all basic dependencies are generated into a dependency graph;
2) using a parser on each of the code objects in the dependency graph to identify DML statements that "fires" triggers thereby identifying dependencies on triggers;
3) applying the recursive algorithm on each of the triggers to incorporate the dependencies of the triggers into the dependency graph; and 4) repeating steps 1-3 for incorporating dependencies on triggers and their dependencies until new dependencies are not added to the dependency graph.
18) The method of claim 17 comprizing the additional step of using the generated dependency information to identify calling paths in a database code coverage tool.
19) The method of claim 17 comprizing the additional step of using the generated dependency information to identify calling paths in a database code object profiling tool.
20) The method of claim 17 comprizing the additional step of using the generated dependency information in a database code object testing tool.
21) The method of claim 17 comprizing the additional step of using the generated dependency information to identify dependent objects that are INVALID in the database.
22) A method of generating dependencies of code objects as well as implementations of object oriented code objects in a database, the method comprising the steps of:
1) applying a recursive algorithm that queries a database for dependency information and outputs a direct dependency graph of a database code object, the "direct dependency graph" containing dependencies that do not involve dependencies on triggers and on implementations of object-oriented code objects in the database;
2) applying the recursive algorithm on each of the object-oriented code objects in the dependency graph to incorporate dependencies of implementations of code objects in the database; and 3) repeating steps 1 and 2 for incorporating dependencies of implementation of object oriented code objects until new dependencies are not added to the dependency graph.
1) applying a recursive algorithm that queries a database for dependency information and outputs a direct dependency graph of a database code object, the "direct dependency graph" containing dependencies that do not involve dependencies on triggers and on implementations of object-oriented code objects in the database;
2) applying the recursive algorithm on each of the object-oriented code objects in the dependency graph to incorporate dependencies of implementations of code objects in the database; and 3) repeating steps 1 and 2 for incorporating dependencies of implementation of object oriented code objects until new dependencies are not added to the dependency graph.
23) The method of claim 22 comprizing the additional step of using the generated dependency information in the direct dependency graph to identify calling paths in a database code coverage tool.
24) The method of claim 22 comprizing the additional step of using the generated dependency information in the direct dependency graph to identify calling paths in a database code object profiling tool.
25) The method of claim 22 comprizing the additional step of using the generated dependency information in the direct dependency graph in a database code object testing tool.
26) The method of claim 22 comprizing the additional step of using the generated dependency information in the direct dependency graph to identify dependent objects that are INVALID in the database.
27) A system for identifying dependencies, if any, of a target data base code object, the system comprizing:
a digital computer;
a database server coupled to the computer;
a data base coupled to the database server having data stored therein, the data comprizing object-oriented code objects, specifications of packages, implementations of packages, specifications of types, implementations of types and triggers; and a code mechanism for generating a dependency graph, the dependency graph being a data structure and having entries to contain representations of depending code objects, specifications of packages, implementations of packages, specifications of types, implementations of types, triggers and dependencies of triggers which are relevant to the target data base code object.
a digital computer;
a database server coupled to the computer;
a data base coupled to the database server having data stored therein, the data comprizing object-oriented code objects, specifications of packages, implementations of packages, specifications of types, implementations of types and triggers; and a code mechanism for generating a dependency graph, the dependency graph being a data structure and having entries to contain representations of depending code objects, specifications of packages, implementations of packages, specifications of types, implementations of types, triggers and dependencies of triggers which are relevant to the target data base code object.
28) A method for generating dependencies of a target data base code object, using a computer having a processor, memory, display, input/output devices, the method comprising the steps of:
providing a data base coupled to the computer having data stored therein, the data comprizing representations of object-oriented code objects, specifications of packages, implementations of packages, specifications of types, implementations of types and triggers; and using a recursive code mechanism for generating a dependency graph, the dependency graph being a data structure and having entries to contain representations of dependent code objects, specifications of packages, implementations of packages, specifications of types, implementations of types, triggers and dependencies of triggers which are relevant to the target data base code object.
providing a data base coupled to the computer having data stored therein, the data comprizing representations of object-oriented code objects, specifications of packages, implementations of packages, specifications of types, implementations of types and triggers; and using a recursive code mechanism for generating a dependency graph, the dependency graph being a data structure and having entries to contain representations of dependent code objects, specifications of packages, implementations of packages, specifications of types, implementations of types, triggers and dependencies of triggers which are relevant to the target data base code object.
29) A computer program product embedded on a computer readable medium for use in debugging a target data base code object comprizing:
a recursive code mechanism for generating a dependency graph of the target data base code object, the dependency graph being a data structure and having entries to contain representations of depending code objects, specifications of packages, implementations of packages, triggers and dependencies of triggers which are relevant to the target data base code object; and a program code mechanism for using the dependency graph to debug the target data base code object.
a recursive code mechanism for generating a dependency graph of the target data base code object, the dependency graph being a data structure and having entries to contain representations of depending code objects, specifications of packages, implementations of packages, triggers and dependencies of triggers which are relevant to the target data base code object; and a program code mechanism for using the dependency graph to debug the target data base code object.
30) A computer program product embedded on a computer readable medium for use in debugging a target data base code object comprizing:
a first program code mechanism for applying a recursive algorithm that queries a database for dependency information and outputs a direct dependency graph of a database code object, the "direct dependency graph" containing dependencies representing dependencies that do not involve dependencies on triggers and on implementations of object-oriented code objects in the database;
a second program code mechanism for applying the recursive algorithm on each of the object-oriented code objects in the direct dependency graph to incorporate dependencies of implementations of code objects in the database;
a third program code mechanism for parsing the source code of the code object to identify DMI, statements that "fires" triggers, thereby identifying the dependencies on triggers;
a fourth program code mechanism for applying the recursive algorithm on each of the triggers to incorporate the dependencies of the triggers into the direct dependency graph;
a fifth program code mechanism for repeating the procedure for incorporating dependencies of implementation of object oriented code objects as well as the dependencies on triggers until new dependencies are not added to the dependency graph; and a sixth program code mechanism for using the dependency graph to debug the target data base code object.
a first program code mechanism for applying a recursive algorithm that queries a database for dependency information and outputs a direct dependency graph of a database code object, the "direct dependency graph" containing dependencies representing dependencies that do not involve dependencies on triggers and on implementations of object-oriented code objects in the database;
a second program code mechanism for applying the recursive algorithm on each of the object-oriented code objects in the direct dependency graph to incorporate dependencies of implementations of code objects in the database;
a third program code mechanism for parsing the source code of the code object to identify DMI, statements that "fires" triggers, thereby identifying the dependencies on triggers;
a fourth program code mechanism for applying the recursive algorithm on each of the triggers to incorporate the dependencies of the triggers into the direct dependency graph;
a fifth program code mechanism for repeating the procedure for incorporating dependencies of implementation of object oriented code objects as well as the dependencies on triggers until new dependencies are not added to the dependency graph; and a sixth program code mechanism for using the dependency graph to debug the target data base code object.
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US09/226,939 | 1999-01-08 | ||
US09/226,939 US7526468B2 (en) | 1999-01-08 | 1999-01-08 | System and method for recursive path analysis of DBMS procedures |
PCT/US2000/000276 WO2000041100A1 (en) | 1999-01-08 | 2000-01-06 | System and method for recursive path analysis of dbms procedures |
Publications (1)
Publication Number | Publication Date |
---|---|
CA2358126A1 true CA2358126A1 (en) | 2000-07-13 |
Family
ID=22851093
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CA002358126A Abandoned CA2358126A1 (en) | 1999-01-08 | 2000-01-06 | System and method for recursive path analysis of dbms procedures |
Country Status (12)
Country | Link |
---|---|
US (1) | US7526468B2 (en) |
EP (1) | EP1208459A4 (en) |
JP (1) | JP2002534742A (en) |
KR (1) | KR20010108075A (en) |
CN (1) | CN1342292A (en) |
AU (1) | AU2720400A (en) |
BR (1) | BR0007412A (en) |
CA (1) | CA2358126A1 (en) |
HK (1) | HK1046174A1 (en) |
IL (2) | IL144106A0 (en) |
WO (1) | WO2000041100A1 (en) |
ZA (1) | ZA200105551B (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102096632A (en) * | 2009-12-10 | 2011-06-15 | Sap股份公司 | Bridging code changes and testing |
Families Citing this family (99)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6108659A (en) * | 1998-12-22 | 2000-08-22 | Computer Associates Think, Inc. | Method and apparatus for executing stored code objects in a database |
JP2001282603A (en) * | 2000-03-29 | 2001-10-12 | Toshihiro Wakayama | Association management system for information contents |
US7110936B2 (en) * | 2001-02-23 | 2006-09-19 | Complementsoft Llc | System and method for generating and maintaining software code |
US7146617B2 (en) | 2001-09-29 | 2006-12-05 | Siebel Systems, Inc. | Method, apparatus, and system for implementing view caching in a framework to support web-based applications |
US6907451B1 (en) | 2001-09-29 | 2005-06-14 | Siebel Systems, Inc. | Method, apparatus, and system for immediate posting of changes in a client server environment |
US8359335B2 (en) | 2001-09-29 | 2013-01-22 | Siebel Systems, Inc. | Computing system and method to implicitly commit unsaved data for a world wide web application |
US7461119B2 (en) | 2001-09-29 | 2008-12-02 | Siebel Systems, Inc. | Method, apparatus, and system for managing status of requests in a client server environment |
US7885996B2 (en) * | 2001-09-29 | 2011-02-08 | Siebel Systems, Inc. | Method, apparatus, and system for implementing notifications in a framework to support web-based applications |
US7870492B2 (en) | 2001-10-02 | 2011-01-11 | Siebel Systems, Inc. | Method, apparatus, and system for managing commands in a client server environment |
US7548935B2 (en) * | 2002-05-09 | 2009-06-16 | Robert Pecherer | Method of recursive objects for representing hierarchies in relational database systems |
US7290007B2 (en) * | 2002-05-10 | 2007-10-30 | International Business Machines Corporation | Method and apparatus for recording and managing data object relationship data |
US6941524B2 (en) * | 2002-05-24 | 2005-09-06 | International Business Machines Corporation | System and method for displaying a recursive relationship between objects in a tree |
US6976144B1 (en) * | 2003-05-06 | 2005-12-13 | Pegasystems, Inc. | Methods and apparatus for digital data processing with mutable inheritance |
US7899797B2 (en) * | 2003-12-04 | 2011-03-01 | International Business Machines Corporation | Package resolution mechanism for database systems |
US7665063B1 (en) | 2004-05-26 | 2010-02-16 | Pegasystems, Inc. | Integration of declarative rule-based processing with procedural programming |
CN1728133B (en) * | 2004-07-27 | 2010-04-28 | 武征 | Object oriented information server, preparation method and browser |
US8335704B2 (en) | 2005-01-28 | 2012-12-18 | Pegasystems Inc. | Methods and apparatus for work management and routing |
US20070055693A1 (en) * | 2005-09-07 | 2007-03-08 | Simon Galbraith | Data recovery method |
US20070180433A1 (en) * | 2006-01-27 | 2007-08-02 | International Business Machines Corporation | Method to enable accurate application packaging and deployment with optimized disk space usage |
US7640222B2 (en) * | 2006-03-03 | 2009-12-29 | Pegasystems Inc. | Rules base systems and methods with circumstance translation |
US9361137B2 (en) | 2006-03-10 | 2016-06-07 | International Business Machines Corporation | Managing application parameters based on parameter types |
US7739267B2 (en) * | 2006-03-10 | 2010-06-15 | International Business Machines Corporation | Classification and sequencing of mixed data flows |
US8924335B1 (en) | 2006-03-30 | 2014-12-30 | Pegasystems Inc. | Rule-based user interface conformance methods |
US8160999B2 (en) | 2006-12-13 | 2012-04-17 | International Business Machines Corporation | Method and apparatus for using set based structured query language (SQL) to implement extract, transform, and load (ETL) splitter operation |
US8219518B2 (en) | 2007-01-09 | 2012-07-10 | International Business Machines Corporation | Method and apparatus for modelling data exchange in a data flow of an extract, transform, and load (ETL) process |
US20080201705A1 (en) | 2007-02-15 | 2008-08-21 | Sun Microsystems, Inc. | Apparatus and method for generating a software dependency map |
US8250525B2 (en) * | 2007-03-02 | 2012-08-21 | Pegasystems Inc. | Proactive performance management for multi-user enterprise software systems |
US20080235673A1 (en) * | 2007-03-19 | 2008-09-25 | Jurgensen Dennell J | Method and System for Measuring Database Programming Productivity |
JP5046715B2 (en) * | 2007-04-06 | 2012-10-10 | 株式会社エヌ・ティ・ティ・データ | Database system and program thereof |
US10089361B2 (en) * | 2007-10-31 | 2018-10-02 | Oracle International Corporation | Efficient mechanism for managing hierarchical relationships in a relational database system |
US8396846B2 (en) * | 2007-12-13 | 2013-03-12 | International Business Machines Corporation | Database trigger modification system and method |
US7925652B2 (en) * | 2007-12-31 | 2011-04-12 | Mastercard International Incorporated | Methods and systems for implementing approximate string matching within a database |
US20090204946A1 (en) * | 2008-02-12 | 2009-08-13 | International Business Machines Corporation | Intelligent software code updater |
US7908252B1 (en) * | 2008-03-19 | 2011-03-15 | Crossroads Systems, Inc. | System and method for verifying paths to a database |
US20090282390A1 (en) * | 2008-05-08 | 2009-11-12 | Microsoft Corporation | Parallel Run-Time Rendering Debugger |
US8799315B2 (en) | 2009-01-30 | 2014-08-05 | International Business Machines Corporation | Selective construction of data search result per search request specifying path information |
US8843435B1 (en) | 2009-03-12 | 2014-09-23 | Pegasystems Inc. | Techniques for dynamic data processing |
US8468492B1 (en) | 2009-03-30 | 2013-06-18 | Pegasystems, Inc. | System and method for creation and modification of software applications |
US8332420B2 (en) * | 2010-01-20 | 2012-12-11 | Siemens Product Lifecycle Management Software Inc. | System and method for performing a database query |
US8326813B2 (en) * | 2010-01-20 | 2012-12-04 | Siemens Product Lifecycle Management Software, Inc. | System and method for data management |
US8290830B2 (en) | 2010-04-07 | 2012-10-16 | Siemens Product Lifecycle Management Software Inc. | System and method for visualization and comparison of physical assets using engineering design data |
US9009682B2 (en) * | 2010-12-13 | 2015-04-14 | Sap Se | Enhanced unit test framework |
US8880487B1 (en) | 2011-02-18 | 2014-11-04 | Pegasystems Inc. | Systems and methods for distributed rules processing |
US8458228B2 (en) | 2011-09-23 | 2013-06-04 | Siemens Product Lifecycle Management Software Inc. | Occurrence management in product data management systems |
US8533237B2 (en) | 2011-09-23 | 2013-09-10 | Siemens Product Lifecycle Management Software Inc. | Data structure partitioning in product data management systems |
US9195936B1 (en) | 2011-12-30 | 2015-11-24 | Pegasystems Inc. | System and method for updating or modifying an application without manual coding |
US9122740B2 (en) * | 2012-03-13 | 2015-09-01 | Siemens Product Lifecycle Management Software Inc. | Bulk traversal of large data structures |
US9652495B2 (en) | 2012-03-13 | 2017-05-16 | Siemens Product Lifecycle Management Software Inc. | Traversal-free updates in large data structures |
US8910134B2 (en) * | 2013-01-03 | 2014-12-09 | Oracle International Corporation | System for applying transformation to improve graph analysis |
US9282160B2 (en) * | 2013-07-15 | 2016-03-08 | Neustar, Inc. | Method, apparatus, and computer readable medium for flexible caching of resource oriented web services |
WO2016018210A1 (en) | 2014-07-28 | 2016-02-04 | Hewlett-Packard Development Company, L.P. | Detection of abnormal transaction loops |
US11296955B1 (en) | 2014-10-09 | 2022-04-05 | Splunk Inc. | Aggregate key performance indicator spanning multiple services and based on a priority value |
US10209956B2 (en) | 2014-10-09 | 2019-02-19 | Splunk Inc. | Automatic event group actions |
US10474680B2 (en) | 2014-10-09 | 2019-11-12 | Splunk Inc. | Automatic entity definitions |
US10305758B1 (en) | 2014-10-09 | 2019-05-28 | Splunk Inc. | Service monitoring interface reflecting by-service mode |
US11755559B1 (en) | 2014-10-09 | 2023-09-12 | Splunk Inc. | Automatic entity control in a machine data driven service monitoring system |
US9210056B1 (en) | 2014-10-09 | 2015-12-08 | Splunk Inc. | Service monitoring interface |
US11087263B2 (en) | 2014-10-09 | 2021-08-10 | Splunk Inc. | System monitoring with key performance indicators from shared base search of machine data |
US9491059B2 (en) | 2014-10-09 | 2016-11-08 | Splunk Inc. | Topology navigator for IT services |
US11671312B2 (en) | 2014-10-09 | 2023-06-06 | Splunk Inc. | Service detail monitoring console |
US10505825B1 (en) | 2014-10-09 | 2019-12-10 | Splunk Inc. | Automatic creation of related event groups for IT service monitoring |
US10536353B2 (en) | 2014-10-09 | 2020-01-14 | Splunk Inc. | Control interface for dynamic substitution of service monitoring dashboard source data |
US9130832B1 (en) | 2014-10-09 | 2015-09-08 | Splunk, Inc. | Creating entity definition from a file |
US10235638B2 (en) | 2014-10-09 | 2019-03-19 | Splunk Inc. | Adaptive key performance indicator thresholds |
US9584374B2 (en) | 2014-10-09 | 2017-02-28 | Splunk Inc. | Monitoring overall service-level performance using an aggregate key performance indicator derived from machine data |
US10193775B2 (en) | 2014-10-09 | 2019-01-29 | Splunk Inc. | Automatic event group action interface |
US9760240B2 (en) | 2014-10-09 | 2017-09-12 | Splunk Inc. | Graphical user interface for static and adaptive thresholds |
US10592093B2 (en) | 2014-10-09 | 2020-03-17 | Splunk Inc. | Anomaly detection |
US11501238B2 (en) | 2014-10-09 | 2022-11-15 | Splunk Inc. | Per-entity breakdown of key performance indicators |
US10447555B2 (en) | 2014-10-09 | 2019-10-15 | Splunk Inc. | Aggregate key performance indicator spanning multiple services |
US11200130B2 (en) | 2015-09-18 | 2021-12-14 | Splunk Inc. | Automatic entity control in a machine data driven service monitoring system |
US9146962B1 (en) | 2014-10-09 | 2015-09-29 | Splunk, Inc. | Identifying events using informational fields |
US9146954B1 (en) | 2014-10-09 | 2015-09-29 | Splunk, Inc. | Creating entity definition from a search result set |
US10417225B2 (en) | 2015-09-18 | 2019-09-17 | Splunk Inc. | Entity detail monitoring console |
US11455590B2 (en) | 2014-10-09 | 2022-09-27 | Splunk Inc. | Service monitoring adaptation for maintenance downtime |
US11275775B2 (en) | 2014-10-09 | 2022-03-15 | Splunk Inc. | Performing search queries for key performance indicators using an optimized common information model |
US9158811B1 (en) | 2014-10-09 | 2015-10-13 | Splunk, Inc. | Incident review interface |
US9864797B2 (en) | 2014-10-09 | 2018-01-09 | Splunk Inc. | Defining a new search based on displayed graph lanes |
US10417108B2 (en) | 2015-09-18 | 2019-09-17 | Splunk Inc. | Portable control modules in a machine data driven service monitoring system |
US10469396B2 (en) | 2014-10-10 | 2019-11-05 | Pegasystems, Inc. | Event processing with enhanced throughput |
US9967351B2 (en) | 2015-01-31 | 2018-05-08 | Splunk Inc. | Automated service discovery in I.T. environments |
US10198155B2 (en) | 2015-01-31 | 2019-02-05 | Splunk Inc. | Interface for automated service discovery in I.T. environments |
CN104933143B (en) * | 2015-06-18 | 2019-06-04 | 北京京东尚科信息技术有限公司 | Obtain the method and device of recommended |
US9411707B1 (en) | 2015-09-30 | 2016-08-09 | Semmle Limited | Implicit software dependency analysis |
US10203952B2 (en) * | 2015-11-18 | 2019-02-12 | Sap Se | Transparently splitting and rewriting data-base object bundles to database entities |
US9971570B2 (en) | 2015-12-15 | 2018-05-15 | Oracle International Corporation | Automated generation of memory consumption aware code |
US10698599B2 (en) | 2016-06-03 | 2020-06-30 | Pegasystems, Inc. | Connecting graphical shapes using gestures |
US10698647B2 (en) | 2016-07-11 | 2020-06-30 | Pegasystems Inc. | Selective sharing for collaborative application usage |
US10942960B2 (en) | 2016-09-26 | 2021-03-09 | Splunk Inc. | Automatic triage model execution in machine data driven monitoring automation apparatus with visualization |
US10942946B2 (en) | 2016-09-26 | 2021-03-09 | Splunk, Inc. | Automatic triage model execution in machine data driven monitoring automation apparatus |
US10025568B2 (en) * | 2016-11-11 | 2018-07-17 | Sap Se | Database object lifecycle management |
US10909090B2 (en) | 2016-11-11 | 2021-02-02 | Sap Se | Database proxy object delivery infrastructure |
US10558529B2 (en) | 2016-11-11 | 2020-02-11 | Sap Se | Database object delivery infrastructure |
US11093518B1 (en) | 2017-09-23 | 2021-08-17 | Splunk Inc. | Information technology networked entity monitoring with dynamic metric and threshold selection |
US11106442B1 (en) | 2017-09-23 | 2021-08-31 | Splunk Inc. | Information technology networked entity monitoring with metric selection prior to deployment |
US11159397B2 (en) | 2017-09-25 | 2021-10-26 | Splunk Inc. | Lower-tier application deployment for higher-tier system data monitoring |
US11048488B2 (en) | 2018-08-14 | 2021-06-29 | Pegasystems, Inc. | Software code optimizer and method |
US11567945B1 (en) | 2020-08-27 | 2023-01-31 | Pegasystems Inc. | Customized digital content generation systems and methods |
US11676072B1 (en) | 2021-01-29 | 2023-06-13 | Splunk Inc. | Interface for incorporating user feedback into training of clustering model |
Family Cites Families (71)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4330822A (en) * | 1971-09-02 | 1982-05-18 | Burroughs Corporation | Recursive system and method for binding compiled routines |
US4558413A (en) * | 1983-11-21 | 1985-12-10 | Xerox Corporation | Software version management system |
US4829427A (en) * | 1984-05-25 | 1989-05-09 | Data General Corporation | Database query code generation and optimization based on the cost of alternate access methods |
US5343554A (en) * | 1988-05-20 | 1994-08-30 | John R. Koza | Non-linear genetic process for data encoding and for solving problems using automatically defined functions |
US5038348A (en) | 1988-07-01 | 1991-08-06 | Sharp Kabushiki Kaisha | Apparatus for debugging a data flow program |
CA2001390C (en) * | 1988-12-19 | 1997-12-30 | Ming-Chien Shan | View composition in a data-base management system |
US5170465A (en) * | 1989-06-30 | 1992-12-08 | Digital Equipment Corporation | Incremental-scanning compiler for source-code development system |
US5325531A (en) * | 1989-06-30 | 1994-06-28 | Digital Equipment Corporation | Compiler using clean lines table with entries indicating unchanged text lines for incrementally compiling only changed source text lines |
US5761493A (en) * | 1990-04-30 | 1998-06-02 | Texas Instruments Incorporated | Apparatus and method for adding an associative query capability to a programming language |
US5175856A (en) | 1990-06-11 | 1992-12-29 | Supercomputer Systems Limited Partnership | Computer with integrated hierarchical representation (ihr) of program wherein ihr file is available for debugging and optimizing during target execution |
US5201046A (en) * | 1990-06-22 | 1993-04-06 | Xidak, Inc. | Relational database management system and method for storing, retrieving and modifying directed graph data structures |
US5237691A (en) * | 1990-08-01 | 1993-08-17 | At&T Bell Laboratories | Method and apparatus for automatically generating parallel programs from user-specified block diagrams |
US5560009A (en) | 1990-09-21 | 1996-09-24 | Hewlett-Packard Company | Generating symbolic debug information by merging translation and compiler debug information |
US5303367A (en) * | 1990-12-04 | 1994-04-12 | Applied Technical Systems, Inc. | Computer driven systems and methods for managing data which use two generic data elements and a single ordered file |
EP0496494A3 (en) * | 1991-01-22 | 1993-05-12 | International Business Machines Corporation | Software maintenance system |
WO1992015066A1 (en) * | 1991-02-26 | 1992-09-03 | Hewlett-Packard Company | Method of evaluating a recursive query of a database |
EP0528631B1 (en) * | 1991-08-13 | 1998-05-20 | Xerox Corporation | Electronic image generation |
US5649204A (en) | 1991-08-22 | 1997-07-15 | Rec Software, Inc. | Method and apparatus for consolidating software module linkage information used for starting a multi-module program |
US5826256A (en) * | 1991-10-22 | 1998-10-20 | Lucent Technologies Inc. | Apparatus and methods for source code discovery |
AU3944793A (en) * | 1992-03-31 | 1993-11-08 | Aggregate Computing, Inc. | An integrated remote execution system for a heterogenous computer network environment |
US6151701A (en) * | 1997-09-30 | 2000-11-21 | Ahpah Software, Inc. | Method for reconstructing debugging information for a decompiled executable file |
US5758160A (en) * | 1993-06-28 | 1998-05-26 | Object Technology Licensing Corporation | Method and apparatus for building a software program using dependencies derived from software component interfaces |
US5404428A (en) | 1993-12-07 | 1995-04-04 | Sun Microsystems, Inc. | Method and system for updating derived items in a view model which includes multiple coordinate systems |
JPH07225707A (en) * | 1994-02-10 | 1995-08-22 | Fujitsu Ltd | Test method for application and test supporting device for the same |
US5813000A (en) | 1994-02-15 | 1998-09-22 | Sun Micro Systems | B tree structure and method |
US5692193A (en) * | 1994-03-31 | 1997-11-25 | Nec Research Institute, Inc. | Software architecture for control of highly parallel computer systems |
DE4416704A1 (en) | 1994-05-11 | 1995-11-16 | Siemens Ag | Integration test procedure for an object-oriented program |
EP0686916A1 (en) * | 1994-06-07 | 1995-12-13 | Digital Equipment Corporation | Method and apparatus for testing software |
US5586328A (en) * | 1994-10-21 | 1996-12-17 | Microsoft Corporation | Module dependency based incremental compiler and method |
WO1996017306A2 (en) * | 1994-11-21 | 1996-06-06 | Oracle Corporation | Media server |
JPH08272648A (en) * | 1994-12-29 | 1996-10-18 | Hitachi Ltd | Method for automatically generating debugging command file and device for automatically regenerating break point in debugging command file |
US5546570A (en) * | 1995-02-17 | 1996-08-13 | International Business Machines Corporation | Evaluation strategy for execution of SQL queries involving recursion and table queues |
US5671416A (en) * | 1995-02-24 | 1997-09-23 | Elson; David | Apparatus and a method for searching and modifying source code of a computer program |
US5724556A (en) | 1995-04-14 | 1998-03-03 | Oracle Corporation | Method and apparatus for defining and configuring modules of data objects and programs in a distributed computer system |
US5689711A (en) | 1995-04-21 | 1997-11-18 | Bardasz; Theodore | Method and apparatus for representing data dependencies in software modeling systems |
US5809283A (en) * | 1995-09-29 | 1998-09-15 | Synopsys, Inc. | Simulator for simulating systems including mixed triggers |
US5872973A (en) * | 1995-10-26 | 1999-02-16 | Viewsoft, Inc. | Method for managing dynamic relations between objects in dynamic object-oriented languages |
US5875334A (en) * | 1995-10-27 | 1999-02-23 | International Business Machines Corporation | System, method, and program for extending a SQL compiler for handling control statements packaged with SQL query statements |
US5751287A (en) | 1995-11-06 | 1998-05-12 | Documagix, Inc. | System for organizing document icons with suggestions, folders, drawers, and cabinets |
US5850554A (en) * | 1995-12-29 | 1998-12-15 | Intel Corporation | Compiler tool set for efficiently generating and easily managing multiple program versions of different types |
US5764989A (en) * | 1996-02-29 | 1998-06-09 | Supercede, Inc. | Interactive software development system |
US5848274A (en) * | 1996-02-29 | 1998-12-08 | Supercede, Inc. | Incremental byte code compilation system |
EP0888585A1 (en) * | 1996-03-19 | 1999-01-07 | Massachusetts Institute Of Technology | Computer system and computer implemented process for representing software system descriptions and for generating executable computer programs and computer system configurations from software system descriptions |
US5835777A (en) * | 1996-03-20 | 1998-11-10 | Hewlett-Packard Company | Method of automatically generating a software installation package |
US5925100A (en) * | 1996-03-21 | 1999-07-20 | Sybase, Inc. | Client/server system with methods for prefetching and managing semantic objects based on object-based prefetch primitive present in client's executing application |
US5774725A (en) * | 1996-06-28 | 1998-06-30 | Microsoft Corporation | Method and computer program product for simplifying construction of a program for testing computer software subroutines in an application programming interface |
US5832484A (en) * | 1996-07-02 | 1998-11-03 | Sybase, Inc. | Database system with methods for parallel lock management |
EP0825524B1 (en) * | 1996-08-20 | 2000-01-19 | Alcatel | Method for naming of objects |
US5987450A (en) * | 1996-08-22 | 1999-11-16 | At&T | System and method for obtaining complete and correct answers from incomplete and/or incorrect databases |
US6314558B1 (en) * | 1996-08-27 | 2001-11-06 | Compuware Corporation | Byte code instrumentation |
US6094528A (en) * | 1996-10-24 | 2000-07-25 | Sun Microsystems, Inc. | Method and apparatus for system building with a transactional interpreter |
US5970490A (en) * | 1996-11-05 | 1999-10-19 | Xerox Corporation | Integration platform for heterogeneous databases |
US5995958A (en) * | 1997-03-04 | 1999-11-30 | Xu; Kevin Houzhi | System and method for storing and managing functions |
US5926819A (en) * | 1997-05-30 | 1999-07-20 | Oracle Corporation | In-line triggers |
US6668325B1 (en) * | 1997-06-09 | 2003-12-23 | Intertrust Technologies | Obfuscation techniques for enhancing software security |
WO1999005593A1 (en) * | 1997-07-25 | 1999-02-04 | British Telecommunications Public Limited Company | Software system generation |
US6366876B1 (en) * | 1997-09-29 | 2002-04-02 | Sun Microsystems, Inc. | Method and apparatus for assessing compatibility between platforms and applications |
US6460043B1 (en) * | 1998-02-04 | 2002-10-01 | Microsoft Corporation | Method and apparatus for operating on data with a conceptual data manipulation language |
US6348927B1 (en) * | 1998-02-27 | 2002-02-19 | Oracle Cor | Composing a description of a virtual 3D world from values stored in a database and generated by decomposing another description of a virtual 3D world |
US6199063B1 (en) * | 1998-03-27 | 2001-03-06 | Red Brick Systems, Inc. | System and method for rewriting relational database queries |
US6311216B1 (en) * | 1998-05-29 | 2001-10-30 | Microsoft Corporation | Method, computer program product, and system for client-side deterministic routing and URL lookup into a distributed cache of URLS |
US6249882B1 (en) * | 1998-06-15 | 2001-06-19 | Hewlett-Packard Company | Methods and systems for automated software testing |
US6769124B1 (en) * | 1998-07-22 | 2004-07-27 | Cisco Technology, Inc. | Persistent storage of information objects |
US6178546B1 (en) * | 1998-08-31 | 2001-01-23 | Alcatel Usa Sourcing, L.P. | System and method of making software product deliverables |
US6493868B1 (en) * | 1998-11-02 | 2002-12-10 | Texas Instruments Incorporated | Integrated development tool |
US6108659A (en) * | 1998-12-22 | 2000-08-22 | Computer Associates Think, Inc. | Method and apparatus for executing stored code objects in a database |
US6334128B1 (en) * | 1998-12-28 | 2001-12-25 | Oracle Corporation | Method and apparatus for efficiently refreshing sets of summary tables and materialized views in a database management system |
US7055098B2 (en) * | 1999-02-19 | 2006-05-30 | Lucent Technologies Inc. | Dynamic display of data item evaluation |
US6405212B1 (en) * | 1999-09-27 | 2002-06-11 | Oracle Corporation | Database system event triggers |
US6651111B2 (en) * | 2001-02-16 | 2003-11-18 | Microsoft Corporation | System and method for managing a serial port |
US6944829B2 (en) | 2001-09-25 | 2005-09-13 | Wind River Systems, Inc. | Configurable user-interface component management system |
-
1999
- 1999-01-08 US US09/226,939 patent/US7526468B2/en not_active Expired - Fee Related
-
2000
- 2000-01-06 CA CA002358126A patent/CA2358126A1/en not_active Abandoned
- 2000-01-06 JP JP2000592758A patent/JP2002534742A/en active Pending
- 2000-01-06 KR KR1020017008647A patent/KR20010108075A/en not_active Application Discontinuation
- 2000-01-06 BR BR0007412-8A patent/BR0007412A/en not_active IP Right Cessation
- 2000-01-06 WO PCT/US2000/000276 patent/WO2000041100A1/en not_active Application Discontinuation
- 2000-01-06 IL IL14410600A patent/IL144106A0/en active IP Right Grant
- 2000-01-06 CN CN00804484A patent/CN1342292A/en active Pending
- 2000-01-06 EP EP00905546A patent/EP1208459A4/en not_active Ceased
- 2000-01-06 AU AU27204/00A patent/AU2720400A/en not_active Abandoned
-
2001
- 2001-07-02 IL IL144106A patent/IL144106A/en not_active IP Right Cessation
- 2001-07-05 ZA ZA200105551A patent/ZA200105551B/en unknown
-
2002
- 2002-10-22 HK HK02107661.1A patent/HK1046174A1/en unknown
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102096632A (en) * | 2009-12-10 | 2011-06-15 | Sap股份公司 | Bridging code changes and testing |
CN102096632B (en) * | 2009-12-10 | 2015-05-20 | Sap欧洲公司 | Bridging code changes and testing |
Also Published As
Publication number | Publication date |
---|---|
WO2000041100A1 (en) | 2000-07-13 |
BR0007412A (en) | 2002-04-09 |
ZA200105551B (en) | 2002-05-09 |
IL144106A (en) | 2006-10-31 |
CN1342292A (en) | 2002-03-27 |
EP1208459A1 (en) | 2002-05-29 |
EP1208459A4 (en) | 2002-09-11 |
US20010049682A1 (en) | 2001-12-06 |
JP2002534742A (en) | 2002-10-15 |
AU2720400A (en) | 2000-07-24 |
IL144106A0 (en) | 2002-05-23 |
HK1046174A1 (en) | 2002-12-27 |
US7526468B2 (en) | 2009-04-28 |
KR20010108075A (en) | 2001-12-07 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US7526468B2 (en) | System and method for recursive path analysis of DBMS procedures | |
US6108659A (en) | Method and apparatus for executing stored code objects in a database | |
US9361094B1 (en) | Mining application repositories | |
Rashid et al. | Persistence as an aspect | |
Gould et al. | JDBC checker: A static analysis tool for SQL/JDBC applications | |
US6243709B1 (en) | Method and apparatus for loading stored procedures in a database corresponding to object-oriented data dependencies | |
US6067641A (en) | Demand-based generation of symbolic information | |
US8352926B2 (en) | Method and apparatus for a cross-platform translator from VB.net to java | |
US6044216A (en) | Method and apparatus for implementing cursor variables for accessing data from database | |
US20130054630A1 (en) | Pre-generation of structured query language (sql) from application programming interface (api) defined query systems | |
Popovic et al. | A DSL for modeling application-specific functionalities of business applications | |
US7499956B1 (en) | Annotation processing from source files and class files | |
Selsam et al. | Tabled typeclass resolution | |
AU2004222703B2 (en) | System and Method for Recursive Path Analysis of DBMS Procedures | |
WO1999032998A1 (en) | Method and apparatus for loading stored procedures in a database corresponding to object-oriented data dependencies | |
Sultana et al. | Understanding and fixing multiple language interoperability issues: the c/fortran case | |
ANTAL | A CRUD IMPLEMENTATION IN JDEVELOPER AND MS ACCESS OF A FLAT DATABASE FOR STORING ROBOT PROGRAMS | |
Shaikhha | An embedded query language in scala | |
de Brugh | Software Model Checking for Mono | |
Schink et al. | Hurdles in Refactoring MultiΓLanguage Programs | |
Debugging | Cross-Platform DB2 Stored Procedures: Building and Debugging | |
Soloviev | Test Report of the Configuration Databases for the Atlas DAQ Prototype-1 | |
Čermák | C++ Object Persistency Using Object/Relational Databases | |
KEPLER | On the Applicability of Annotation-based Source Code Modification in Kotlin | |
Navaneetha et al. | Department of computer science and engineering |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
EEER | Examination request | ||
FZDE | Discontinued |