摘要:
A SEQUENCED request a) to apply a temporal Source table to a temporal Target table under a predicate is received. The Source table includes a plurality of rows that qualify to apply to a single Target table row under the predicate. The predicate specifies a Source table join column. Each of the plurality of Source table rows and the single Target table row include a ValidTime dimension. The plurality of Source table rows is b) ordered by the Source table join column and a period-to-be-modified. The next of the ordered plurality of Source table rows is c) applied by determining that the Target table row has a TransactionTime and, in response, closing out the TransactionTime of the Target table row. Applying the next of the ordered plurality of Source table rows includes identifying an RDIFF range as the period-to-be-modified of the Source table row being applied that is later than the ValidTime range of the single Target table row. Applying the next of the ordered plurality of Source table rows includes creating an RDIFF row being the same as the Target table row except the ValidTime of the RDIFF row is set to RDIFF range. A second of the ordered plurality of Source table rows d) is applied by applying c) to the RDIFF row as the Target table row.
摘要:
A method, computer program, and database system are disclosed. A plurality of instances of a request to a database system are received. All instances of the request have a same set of variables to use in executing the request. The values of the variables are supplied by data in a data source. A specific plan for executing one instance of the request is generated. Generating the specific plan includes taking into account data in the data source. The specific plan is executed on the database system. A system run-time metric and a parsing time for executing the specific plan are captured and saved. A generic plan is generated and cached based on a comparison of the system run-time metric and the parsing time for executing the specific plan.
摘要:
A base table temporal row affected by a transaction is timestamped. The temporal row has a row ID. The temporal row in the base table is modified according to the transaction. The row ID for the modified temporal row is associated with an identifier for the transaction in a temporal work table. Upon committing the transaction: the temporal work table is searched to determine the row ID of the temporal row modified by the transaction, and a commit-time is saved into the temporal row identified by the row ID.
摘要:
A method and system for performing logical partial declustering in a shared-nothing database environment. The solution defines a partial declustering technique that can be used to dynamically adapt the declustering of base tables or intermediate result sets. The partial declustering technique is defined to limit the number of partitions (P) involved in an operation. The technique is defined to limit the operation to a subset of the system partitioning map (SPM). There are two components: the association between the data values and partitions is altered by restricting the data values to P′ partition values where P′ is less than P; and the actual partitions of the SPM selected are then derived based on a seed derived from a dynamic parameter, such as a session number, or a static parameter, such as a table identifier. In the case of intermediate result sets the number of P′ partitions selected is a cost based decision based on the estimated number of rows in the input intermediate result sets. In the case of a base table the number of P′ partitions is selected based on the table DDL. There is no physical partitioning definitions, rather logical partitions are defined based on subsetting the SPM.
摘要:
There is provided a parallel database system 1. System 1 includes a storage device 2 for maintaining a plurality of rows 3. System 1 also includes a plurality of access modules 4 for accessing in parallel a respectively assigned one or more of rows 3. An interface 5 receives data 6 indicative of a table 7 defined by a selection 8 of rows 3. A processor 9 is responsive to data 6 for selectively designating table 7 to be a single-module table. In this single module table, selection 8 is collectively assigned to an owning one of modules 4, indicated by reference numeral 10.
摘要:
A method for retrieving information from a database includes identifying a cylinder. The cylinder includes a plurality of data segments. The method also includes retrieving the plurality of data segments from the cylinder during a single retrieval operation. In addition, the method includes storing the plurality of data segments in a cache.
摘要:
There is provided a method, system and computer program for updating at least one component in a multi-component software application. The method includes receiving application data describing characteristics of the software application, receiving update data describing at least one update applicable to the software application and reviewing the application data and update data to determine whether the at least one update is applied to the software application.
摘要:
There is provided a database system 1 including a source cluster, in the form of a source clique 2, for providing a clique shared spool file 3. This spool file is provided for consumption by a target module 4 belonging to a target cluster, in the form of a target clique 5. A node interconnect 6 receives of spool 3, and exports the spool for consumption by module 4.
摘要:
A method, computer program and database system are disclosed for joining a plurality of tables T1 through TN, where each of the tables has an associated Star Map, S1 through SN, respectively. Each Star Map includes bitmap entries having locations indexed by the hash of one or more values associated with one or more join key columns of its associated table. A bitmap entry in a Star Map, if set, indicates the presence of a row in its associated table that has entries in the one or more join key columns that together hash to the location of the bitmap entry. The method includes a) performing a Boolean operation using the bitmap entries of the Star Maps S1 through SN to produce a join Star Map SJ, b) using SJ to select rows from the tables T1 through TN, and c) joining the resulting rows to produce a join result.
摘要:
A method, computer program and database system are disclosed for performing an outer join of at least a first table T1 and a second table T2. The join has join conditions. Each of the tables has an associated Star Map, S1 and S2, respectively. Each Star Map includes bitmap entries which have locations indexed by the hash of one or more values associated with one or more join key columns of its associated table. A bitmap entry in a Star Map, if set, indicates the presence of a row in its associated table that has entries in the one or more join key columns that together hash to the location of the bitmap entry. The method, computer program and database system include a) performing one or more Boolean operations using the bitmap entries of the Star Maps S1 and S2 to produce set bitmap entries in a Star Map SJ where there is a corresponding set bitmap entry in S1 and a corresponding set bitmap entry in S2, b) selecting a row from table T1 and hashing the combined entries in the one or more join key columns of the selected T1 row to identify a bitmap entry in SJ, and c) if the identified bitmap entry in SJ is not set, projecting the selected T1 row with a NULL corresponding to data from table T2. If d) the identified bitmap entry in SJ is set, performing the following: d1) if no row in T2 satisfies the join conditions and has entries in its one or more join key columns that together hash to the location of the identified set bitmap entry in SJ, projecting the selected T1 row and a NULL corresponding to data from table T2, d2) otherwise, for each row from T2 that satisfies the join condition and has entries in its one or more join key columns that together hash to the location of the identified set bitmap entry in SJ, projecting the selected T1 row with data from the row from T2, and e) repeating b)-d) for all rows in T1.