Abstract: Provided are techniques for processing window partitioning and ordering for OLAP functions. A prior compare operation is performed by: receiving an input vector for each of one or more attributes of input data that represent one of a partition-by column and an order-by column in a database query; generating a per-attribute comparison vector for each input vector; and producing a single output vector using each per-attribute comparison vector, wherein each value of the single output vector is a Boolean attribute whose value for a given tuple is true if a current value and a most recent prior value of any of the one or more attributes are different.

Abstract: Provided are techniques for processing window partitioning and ordering for OLAP functions. A prior compare operation is performed by: receiving an input vector for each of one or more attributes of input data that represent one of a partition-by column and an order-by column in a database query; generating a per-attribute comparison vector for each input vector; and producing a single output vector using each per-attribute comparison vector, wherein each value of the single output vector is a Boolean attribute whose value for a given tuple is true if a current value and a most recent prior value of any of the one or more attributes are different.

Abstract: Provided are techniques for processing window partitioning and ordering for OLAP functions. A prior compare operation is performed by: receiving an input vector for each of one or more attributes of input data that represent one of a partition-by column and an order-by column in a database query; generating a per-attribute comparison vector for each input vector; and producing a single output vector using each per-attribute comparison vector, wherein each value of the single output vector is a Boolean attribute whose value for a given tuple is true if a current value and a most recent prior value of any of the one or more attributes are different.

Abstract: Provided are techniques for processing window partitioning and ordering for OLAP functions. A prior compare operation is performed by: receiving an input vector for each of one or more attributes of input data that represent one of a partition-by column and an order-by column in a database query; generating a per-attribute comparison vector for each input vector; and producing a single output vector using each per-attribute comparison vector, wherein each value of the single output vector is a Boolean attribute whose value for a given tuple is true if a current value and a most recent prior value of any of the one or more attributes are different.

Abstract: Provided are techniques for processing window partitioning and ordering for OLAP functions. A prior compare operation is performed by: receiving an input vector for each of one or more attributes of input data that represent one of a partition-by column and an order-by column in a database query; generating a per-attribute comparison vector for each input vector; and producing a single output vector using each per-attribute comparison vector, wherein each value of the single output vector is a Boolean attribute whose value for a given tuple is true if a current value and a most recent prior value of any of the one or more attributes are different.

Abstract: Provided are techniques for processing window partitioning and ordering for OLAP functions. A prior compare operation is performed by: receiving an input vector for each of one or more attributes of input data that represent one of a partition-by column and an order-by column in a database query; generating a per-attribute comparison vector for each input vector; and producing a single output vector using each per-attribute comparison vector, wherein each value of the single output vector is a Boolean attribute whose value for a given tuple is true if a current value and a most recent prior value of any of the one or more attributes are different.

Abstract: A system and method for compensating for functional differences between heterogeneous database management systems, wherein data associated with a client is distributed among the heterogeneous database management systems, is discussed. The system simulates support of multiple pending actions on a single connection in any of the heterogeneous database management systems which does not support multiple pending actions on a single connection.

Abstract: A system and method for compensating for functional differences between heterogeneous database management systems, wherein data associated with a client is distributed among the heterogeneous database management systems, is discussed. The system simulates support of multiple pending actions on a single connection in any of the heterogeneous database management systems which does not support multiple pending actions on a single connection.

Abstract: A system, method and computer program product for providing a common interface to a plurality of heterogeneous database management systems, wherein data associated with a client is distributed among the plurality of heterogeneous database management systems. The system simulates support of host variables in any of the heterogeneous database management systems which does not support host variables.

Abstract: A system, method and computer program product for providing a common interface to a plurality of heterogeneous database management systems, wherein data associated with a client is distributed among the plurality of heterogeneous database management systems. The system simulates support of multiple pending database actions on a single connection in any of the heterogenous database management systems which does not support multiple pending database actions on a single connection. Also, the system simulates support of cursors declared “with hold” in any of the heterogenous database management systems which does not support cursors declared “with hold”.

Abstract: A system, method and computer program product for providing a common interface to a plurality of heterogeneous database management systems, wherein date associated with a client is distributed among the plurality of hetergeneous database management systems. The system simulates support of positioned update actions in any of the heterogeneous database management systems which does not support positioned update actions.

Abstract: A system, method and computer program product for providing a common interface to a plurality of heterogeneous database management systems, wherein data associated with a client is distributed among the plurality of heterogeneous database management systems. The system compensates for security log-in procedure differences between the heterogeneous database management systems.

Abstract: The performance of a heterogeneous, distributed database system is optimized by supporting both block fetch operations and positioned update operations. Specifically, a data block is fetched from a target database management system (DBMS), and a positioned update instruction issued by a client is processed. The positioned update instruction, when executed by the target DBMS, enables the target DBMS to modify a row contained in the data block and addressed by a cursor as the cursor is perceived by the client. Also, performance of the database system is optimized by identifying database statements that reference invariant host variables, and modifying such database statements by replacing in the database statements the host variables with literal values equivalent to the host variables.

Abstract: The performance of a heterogeneous, distributed database system is optimized by supporting both block fetch operations and positioned update operations. Specifically, a data block is fetched from a target database management system (DBMS), and a positioned update instruction issued by a client is processed. The positioned update instruction, when executed by the target DBMS, enables the target DBMS to modify a row contained in the data block and addressed by a cursor as the cursor is perceived by the client. Also, performance of the database system is optimized by identifying database statements that reference invariant host variables, and modifying such database statements by replacing in the database statements the host variables with literal values equivalent to the host variables.

Abstract: A system and method for compensating for functional differences between heterogeneous database management systems, wherein data associated with a client is distributed among the heterogeneous database management systems, is discussed. The system simulates support of multiple pending actions on a single connection in any of the heterogeneous database management systems which does not support multiple pending actions on a single connection. Also, the system: (1) simulates support of cursors declared "with hold" in any of the heterogeneous database management systems which does not support cursors declared "with hold"; (2) simulates support of positioned update actions in any of the heterogeneous database.

Abstract: The performance of a heterogeneous, distributed database system is optimized by supporting both block fetch operations and positioned update operations. Specifically, a data block is fetched from a target database management system (DBMS), and a positioned update instruction issued by a client is processed. The positioned update instruction, when executed by the target DBMS, enables the target DBMS to modify a row contained in the data block and addressed by a cursor as the cursor is perceived by the client. Also, performance of the database system is optimized by identifying database statements that reference invariant host variables, and modifying such database statements by replacing in the database statements the host variables with literal values equivalent to the host variables.

Abstract: A system and method for compensating for functional differences between heterogeneous database management systems, wherein data associated with a client is distributed among the heterogeneous database management systems, is discussed. The system simulates support of multiple pending actions on a single connection in any of the heterogeneous database management systems which does not support multiple pending actions on a single connection.

Abstract: High performance query optimization in a heterogeneous distributed multi-database system. An efficient technique is disclosed to enable an interface module, located between a host computer and a back-end database system, to perform maximal query or subquery push down. That is, the interface module is configured to select either the entire query or the largest subquery(s) that can be forwarded to a single database instance within the back-end database system without extensive decomposition or extraneous commands. The interface module has stored therein a data structure having information concerning the data stored in, and the capabilities of, each of the back-end databases in the heterogeneous environment. Based on this information, the interface module determines whether a query or subquery satisfies two criteria. First, the interface module determines whether a single database instance within the heterogeneous environment contains all of the data referenced in the query or subquery.

Abstract: High performance query optimization in a heterogeneous distributed multi-database system. An efficient technique is disclosed to enable an interface module, located between a host computer and a back-end database system, to perform maximal query or subquery push down. That is, the interface module is configured to select either the entire query or the largest subquery(s) that can be forwarded to a single database instance within the back-end database system without extensive decomposition or extraneous commands. The interface module has stored therein a data structure having information concerning the data stored in, and the capabilities of, each of the back-end databases in the heterogeneous environment. Based on this information, the interface module determines whether a query or subquery satisfies two criteria. First, the interface module determines whether a single database instance within the heterogeneous environment contains all of the data referenced in the query or subquery.

Abstract: The present invention provides a system and method for retrieving data from a computerized database system. Prior to execution of a query statement, the system determines an optimal sequential execution plan for the query statement. The optimal sequential execution plan is used to determine an optimal parallel execution plan. During the execution of the query, run time variables are used to determine whether to use the sequential execution plan without modification or a modification of the parallel execution plan.