International Business Machines Corporation

Melvin R Zimowski

Roger A Reinsch

Bruce Gilbert Lindsay

Robert J Grafe

Robert Peter Resch

Patricia G Selinger

John G Adair

Curt Lee Cotner

Steven Jay Greenspan

Jeffrey David Aman

Patrick Michael Livecchi

Peter K Shum

Daniel J Coyle, Jr

Richard A Demers

Richard R Sanders

Akira Shibamiya

Harold Hershey Hall, Jr

Lynh Nguyen

Jacob Slonim

Norbert Runge

Robert Dean Jackson

Dusan Ecimovic

Michael E Murphy

Robert L Sunday

Robert A Gilles

Robert D Jackson

A method, system, and program product to migrate data from a data table in a data source to a data table in a target. This is done initiating processes, typically two parallel batch processes, with one of the processes unloading the data from the data source and uploading the data into the data target, and the other of the processes loading the source data into a database at the data target. Preferably the processes are parallel batch process. The processes are initiated from the data target.

Method, system, and program product for migrating data from one data base management system to another data base management system

A method, apparatus, and article of manufacture for managing data stored in a data storage device connected to a computer. In accordance with the present invention, it is determined that a web page is to be cached. The web page references other objects. The referenced objects are stored in one or more data stores. The web page is cached. The cached web page and the referenced objects are managed in a coordinated fashion to ensure the display of a complete Web page.

Method for maintaining and managing dynamic web pages stored in a system cache and referenced objects cached in other data stores

A system, method, and article of manufacture for caching a pre-processed version of an interpreted application at the time the interpreted application is first interpreted and executed by a computer, thereby improving response time for subsequent executions of the interpreted application. The pre-processed version of the interpreted application captures all execution paths through the interpreted application, despite the fact that the first execution of the interpreted application may only exercise a subset of the possible execution paths therein. Modifications to the interpreted application are dynamically detected, so that the pre-processed version can be replaced in the cache as needed.

Method and system for enhancing the performance of interpreted web applications

A method, apparatus, and article of manufacture for processing a request that requires the dynamic generation of a web page. In accordance with the present invention, a request to generate a dynamic web page is received. It is determined whether the request can be satisfied by using a cached web page and whether the userid associated with the request is authorized to access the cached web page. When it is determined that the request can be satisfied and that the userid has the proper authorization, the cached Web page is used to satisfy the request.

Technique for ensuring authorized access to the content of dynamic web pages stored in a system cache

A method and system for retrieving data from a database over a network includes: generating an executable statement at a gateway in accordance with a macro language file, where the executable statement comprises one or more a parameter markers; passing the executable statement from the gateway to database software; and passing a value for each parameter marker from the gateway to the database software. The present invention allows the Net.Data gateway to support parameter markers in place of Net.Data variables. This allows the Net.Data gateway to take advantage of the dynamic Structured Query Language (SQL) statement caching feature available with conventional database systems. With the use of this invention, the execution of the SQL statements occurs more rapidly, saving resources and improving performance. Additionally, the Net.Data variables may be automatically replaced with parameter markers, with the Net.Data variables and their values maintained. This provides transparent support for parameter markers.

Transparent parameter marker support for a relational database over a network

A system and method for processing a request utilizing a database management system in a computer system is disclosed. The database management system manages at least one database. At least one database subsystem corresponding to the database management system is available. The computer system includes a plurality of worker threads. The method and system include assigning the request to a worker thread of the plurality of worker threads. The worker thread is for aiding in execution of the request. The method and system also include providing a connection to a particular database subsystem for the worker thread and associating the connection with the worker thread if the worker thread has not previously used the particular database subsystem. The method and system further include reusing the connection to the particular database subsystem that is associated with the worker thread if the worker thread has previously used the particular database subsystem.

Method and system for managing connections to a database management system

Method and system for managing connections to a database management

A system for processing diverse and non-diverse result sets is described. The system includes a client process in a client computer system that constructs a client process execution request identifying a stored procedure and specifying constraints on the quantity of response data that the client process is capable of handling. The client process execution request is transferred from the client process in the client computer system to a server process in a server computer system. The server process invokes the stored procedure identified by the client process execution request. Execution of the stored procedure results in the generation of answer set data for a plurality of diverse query result sets. Result set generators obtain answer set data for X of the query result sets, where X is defined by the constraints. The server process then generates an initial response containing, for each of the X query result sets, an amount of the obtained answer set data consistent with the constraints. The initial response is transferred from the server computer system to the client process in the client computer system. The client application is then able to access and process answer set data for the diverse result sets in any order.

Computer program product to efficiently process diverse result sets

System and method for efficiently processing diverse result sets

The invention establishes the context in which data exchanged between dissimilar relational database management systems can be mutually understood and preserved, and data conversions can be minimized. The invention accomplishes this by establishing layers of descriptive information which isolate machine characteristics, levels of support software, and user data descriptions. Optimized processing is achieved by processing the different descriptor levels at different times during the development and execution of the database management systems. Minimal descriptive information is exchanged between the cooperating database management systems. Any data conversions that may be necessary are done only by the receiver of the data, and only at the point where it is necessary to have the data represented in the receiver's native format for processing. For sending and receiving systems which match, data conversion is completely avoided, even when the data may have been forwarded through intermediate DBMS systems which do not match. For sending and receiving systems which do not match, data conversion is minimized. The data conversion routines and tables in each system are also minimized by requiring conversion only INTO a system's native format, never FROM its native format into some other format.

Method and combination for minimizing data conversions when data is

The invention provides transaction synchronization in the form of COMMIT processing in a distributed, heterogeneous database system wherein some resources are synchronized to a transaction by a single-phase commit procedures while other resources synchronize by multi-phase commit procedures. The invention invests an application requestor at an application site with authority to represent all single-phase commit resources in multi-phase commit processing.

Method for synchronizing transaction processing in a distributed

Heterogenous database communication system in which communicating

The invention establishes the context in which data exchanged between dissimilar relational database management systems can be mutually understood and preserved. The invention accomplishes this by establishing layers of descriptive information which isolate machine characteristics, levels of support software, and user data descriptions. Optimized processing is achieved by processing the different descriptor levels at different times during the development and execution of the database management systems. Minimal descriptive information is exchanged between the cooperating database management systems. For systems which match, data conversion is completely avoided. For systems which do not match, data conversion is minimized.

Method and system for describing and exchanging data between

Application programs which are developed and scheduled within a first computing system environment are permitted to access relational data registered at a remote database management system (DBMS) operating in a second computing environment dissimilar to the first computing environment. Access to data through the DBMS from an application execution site remote from the DBMS is supported by a process, logically subordinate to the application program which maps application program data access requests to the DBMS.

Query language execution on heterogeneous database servers using a

A method for more accurately estimating the time required to process a data base query using a selected index. A selected number of the most frequently occurring index key values (38) are collected during an index sequential scan. These most frequency occurring values are stored as percentage frequencies of occurrence in the data base system's catalog (42). Estimated access and processing times (NPAR, NPAS, NCPU) for a given query are calculated based on the stored frequencies where possible. Where the query's search criteria specify values other than the stored most frequently occurring values, those values are assumed to be uniformly distributed.

Growing community of inventors

San Jose, CA, United States of America

Melvin R Zimowski