Abstract: The present invention provides a method, system, and computer program product for identifying data synchronization problems between data in different databases. The method includes: providing first and second databases containing common data; generating a summary of the common data as present in the first database; generating a summary of the common data as present in the second database; determining at least one delta value for the common data between the first and second databases; and generating an analysis view displaying the summary of the common data as present in the first database, the summary of the common data as present in the second database, and the at least one delta value for the common data between the first and second databases.

Abstract: Under the present invention, index keys are generated for a set of documents. This is typically accomplished by examining the set of documents, and connecting data values extracted from the set of documents to yield the index keys. Once the index keys are generated, an index view will be generated into which the index keys are populated. Using the index keys in the index view, an agent will automatically obtain the set of documents (i.e., in the background). Then, when a user requests one of the documents, the document will already have been retrieved from storage. As such, it can readily be provided to the user. It should be understood that as used herein, the term “document” is intended to refer to any type of electronically stored data.

Abstract: Complex nested if-then statement on data objects in a digital computer are organized as a plurality of logical case statements; for each case statement, a set of binary condition arrays is provided and for each data object a condition set. Case statements are executed on the data objects for which a condition array from the set of binary condition arrays matches the condition set for the data object.

Abstract: A system and computer program product for transferring N table instances X1, X2, . . . , XN of a table T from a source database S to destination databases D1, D2, . . . , DN, respectively. The method is implemented by executing a computer code by a processor of a computer system. N is at least 1. For I=1, 2, . . . , N the method includes: determining whether the table T has been defined for destination database DI, and if it is determined that the table T has not been defined for the destination database DI then defining the table T for the destination database DI; and transferring the instance XI of the N table instances from the source database S into the defined table T of the destination database DI.

Abstract: Maintaining and testing a software application by performing regression testing uses standard reusable test cases from change history records to generate actual test cases. A new test case template is created upon saving a change history entry. A subset of the actual and new test cases is determined, and new actual test cases generated and documented from the subset. The new actual test cases are released after successful verification.

Abstract: A system and program product for updating a data record of a database to cancel a deployment of a computer workstation. A deployment status is changed from a starting status to a deployed status via intermediate statuses and then the deployment is canceled. From a decision tree stored in the database, a list of identifiers that identifies an ordered list of software routines is generated. An email message is created that includes a selectable object and a hidden field. The list of identifiers is inserted into the hidden field. The email message is sent to a user. The user's selection of the selectable object is received. The list of identifiers is obtained from the hidden field and the software routines are retrieved from the database. The software routines are executed in their order to update the status from deployed to the starting status via updates to the intermediate statuses.

Abstract: A method, system and computer program product for managing goals. A goal to be achieved by a goal-setter is defined. At least one action to be completed is defined. The at least one action is associated with an achievement of the goal by the goal-setter. One or more goal-setter attributes associated with the goal-setter are specified. At least one of the one or more goal-setter attributes is associated with the goal to facilitate managing the goal.

Abstract: System, method and computer program product for creating, managing, and accessing an information repository including a source database and an archive database. A source database and the archive database are defined to a same schema. A user terminal presents a common user interface for accessing the source database and the archive database. A timed archive agent, an end user archive agent, and a criteria based archive agent archive source data from the source database as archive data to the archive database. A criteria based restore agent and an end user restore agent are provided to restore archive data from the archive database as source data to the source database. An integrated functions agent assembles compiled data from source data and archive data and present the compiled data to the user interface.

Abstract: Under the present invention, when an error condition for the computer system is identified, settings for a series of demographical factors of the computer system are determined. These settings are compared to settings for the demographical factors during at least one previous instance of the error condition to identify a similar error scenario. Then any corrective actions that were taken to address the at least one previous instance of the error conditions are determined and possibly used to resolve the current error condition.

Abstract: A script library includes a plurality of common blocks of code including code fragments defined by IF/THEN statements. Packages of parameters forming a data type including a scope parameter are provided in agents which, responsive to being triggered by schedule or menu, issue calls including said scope parameter to functions and procedures said script library. Code fragments bounded by IF/THEN statements within each called function and procedure execute responsive to the scope parameters to operate on entries in a database responsive to other parameters included within the data type.

Abstract: A database is queried with on demand database query reduction A query document includes global variables selectively set off by first tags identifying a first global variable as a complete replacement variable and by second tags identifying a second global variable as a complete removal string. An agent is provided for building from the query document an expanded query by replacing any variables set off by first tags with runtime strings, setting off any unions in the query document, and selectively replacing any variables set off by second tags and removing the second tags without replacing variables set off by second tags.

Abstract: A database is queried with on demand database query reduction A query document includes global variables selectively set off by first tags identifying a first global variable as a complete replacement variable and by second tags identifying a second global variable as a complete removal string. An agent is provided for building from the query document an expanded query by replacing any variables set off by first tags with runtime strings, setting off any unions in the query document, and selectively replacing any variables set off by second tags and removing the second tags without replacing variables set off by second tags.

Abstract: Aspects of the present invention provide a solution for managing database agents. Specifically, an embodiment of the present invention produces a predetermined number of replica databases for running the agents. Agent scheduling documents are produced and parsed to determine on which database the agent should be run and on which database the agent should run if the first choice of databases is not functioning. The agent scheduling documents also specify whether running of a specific agent has certain prerequisites, such as a time constraint and/or whether its running is dependent upon successful completion of another agent.

Abstract: A system and program product for updating a data record of a database to cancel a deployment of a computer workstation. A deployment status is changed from a starting status to a deployed status via intermediate statuses and then the deployment is canceled. From a decision tree stored in the database, a list of identifiers that identifies an ordered list of software routines is generated. An email message is created that includes a selectable object and a hidden field. The list of identifiers is inserted into the hidden field. The email message is sent to a user. The user's selection of the selectable object is received. The list of identifiers is obtained from the hidden field and the software routines are retrieved from the database. The software routines are executed in their order to update the status from deployed to the starting status via updates to the intermediate statuses.

Abstract: A method for updating a data record of a database to cancel a deployment of a computer workstation. A status of the deployment is changed from a starting status to a deployed status via intermediate statuses and then the deployment is canceled. From a decision tree stored in the database, a list of identifiers that identifies an ordered list of software routines is generated. An Email message is created that includes a selectable object and a hidden field. The list of identifiers is inserted into the hidden field. The email message is sent to a user. The user's selection of the selectable object is received. The list of identifiers is obtained from the hidden field and the software routines are received from the database. The software routines are executed in their order to update the status from deployed to the starting status via updates to the intermediate statuses.

Abstract: A system and computer program product for transferring N table instances X1, X2, . . . , XN of a table T from a source database S to destination databases D1, D2, . . . , DN, respectively. The method is implemented by executing a computer code by a processor of a computer system. N is at least 1. For I=1, 2, . . . , N the method includes: determining whether the table T has been defined for destination database DI, and if it is determined that the table T has not been defined for the destination database DI then defining the table T for the destination database DI; and transferring the instance XI of the N table instances from the source database S into the defined table T of the destination database DI.

Abstract: A method, system, and computer program product for transferring N table instances X1, X2, . . . , XN of a table T from a source database S to destination databases D1, D2, . . . , DN, respectively. The method is implemented by executing a computer code by a processor of a computer system. N is at least 1. For I=1, 2, . . . , N the method includes: determining whether the table T has been defined for destination database DI, and if it is determined that the table T has not been defined for the destination database DI, then defining the table T for the destination database DI; and transferring the instance XI of the N table instances from the source database S into the defined table T of the destination database DI.

Abstract: Aspects of the present invention provide a solution for creating a workflow that defines a business process. Specifically, an embodiment of the present invention provides a way for a user to gather overall goals of the business process and to use these goals to define a plurality of stages that represent subsets of the overall business process. For at least one of the stages, the user lists a plurality of activities that are included in the stage as well as the flow among activities in the stage. Each activity in the stage includes operational details that define the process of the activity. The operational details may include preliminary actions, prerequisite conditions and results.

Abstract: Under the present invention, index keys are generated for a set of documents. This is typically accomplished by examining the set of documents, and connecting data values extracted from the set of documents to yield the index keys. Once the index keys are generated, an index view will be generated into which the index keys are populated. Using the index keys in the index view, an agent will automatically obtain the set of documents (i.e., in the background). Then, when a user requests one of the documents, the document will already have been retrieved from storage. As such, it can readily be provided to the user. It should be understood that as used herein, the term “document” is intended to refer to any type of electronically stored data.

Abstract: Under the present invention, index keys are generated for a set of documents. This is typically accomplished by examining the set of documents, and connecting data values extracted from the set of documents to yield the index keys. Once the index keys are generated, an index view will be generated into which the index keys are populated. Using the index keys in the index view, an agent will automatically obtain the set of documents (i.e., in the background). Then, when a user requests one of the documents, the document will already have been retrieved from storage. As such, it can readily be provided to the user. It should be understood that as used herein, the term “document” is intended to refer to any type of electronically stored data.