Abstract: An operator tree is formed for a data processing plan, the operator tree containing a plurality of interconnected nodes and including a grouping of two or more duplicative portions, each of the two or more duplicative portions having identical nodes and structure such that when the operator tree is executed, operators executed in a first duplicative portion using a first thread perform same functions use different data than operators in a second duplicative portion using a second thread. One or more operators in the first portion and one or more operators in the second portion to be synchronized with each other are identified. A synchronization point is created for the identified operators in the first thread and one or more subsequent threads, wherein the synchronization point receives information from each of the identified operators to build an artifact to deliver to one or more operators that depend on the artifact.

Abstract: An operator tree is formed for a data processing plan, the operator tree containing a plurality of interconnected nodes arid including a grouping of two or more duplicative portions, each of the two or more duplicative portions having identical nodes and structure such that when the operator tree is executed, operators executed in a first duplicative portion using a first thread perform same functions use different data than operators in a second duplicative portion using a second thread. One or more operators in the first portion and one or more operators in the second portion to be synchronized with each other are identified. A synchronization point is created for the identified operators in the first thread and one or more subsequent threads, wherein the synchronization point receives information from each of the identified operators to build an artifact to deliver to one or more operators that depend on the artifact.

Abstract: An operator tree is formed for a data processing plan, the operator tree containing a plurality of interconnected nodes and including a grouping of two or more duplicative portions, each of the two or more duplicative portions having identical nodes and structure such that when the operator tree is executed, operators executed in a first duplicative portion using a first thread perform same functions use different data than operators in a second duplicative portion using a second thread. One or more operators in the first portion and one or more operators in the second portion to be synchronized with each other are identified. A synchronization point is created for the identified operators in the first thread and one or more subsequent threads, wherein the synchronization point receives information from each of the identified operators to build an artifact to deliver to one or more operators that depend on the artifact.

Abstract: A system, method, and computer program product are provided for improving performance of positional text conditions in concert with bitmap-based conditions. This is accomplished, for example, by focusing positional text condition evaluation to candidate rows based on a bitmap resulting from application of a prior condition. Additionally, the result of a positional text condition may itself be provided in the form of a bitmap to accelerate further bitmap-based condition processing.

Abstract: A system, method, and computer program product are provided for improving performance of positional text conditions in concert with bitmap-based conditions. This is accomplished, for example, by focusing positional text condition evaluation to candidate rows based on a bitmap resulting from application of a prior condition. Additionally, the result of a positional text condition may itself be provided in the form of a bitmap to accelerate further bitmap-based condition processing.

Abstract: A system, method, and computer program product are provided for immediately updating a materialized view in a relational database management system. The method includes the steps of creating a materialized view defined over a base table, executing an update statement on the base table, computing a delta of the base table by comparing images of the base table before execution of the update statement and after execution of the update statement, computing a delta of the materialized view based on the delta of the base table, and updating the materialized view using the delta of the materialized view.

Abstract: A system, method, and computer program product are provided for immediately updating a materialized view in a relational database management system. The method includes the steps of creating a materialized view defined over a base table, executing an update statement on the base table, computing a delta of the base table by comparing images of the base table before execution of the update statement and after execution of the update statement, computing a delta of the materialized view based on the delta of the base table, and updating the materialized view using the delta of the materialized view.