International Business Machines Corporation

Thomas F Boehme

Andreas Brodt

Oliver Schiller

Daniel Martin

Namik Hrle

Oliver Koeth

James L Finnie

Felix O Beier

Knut Stolze

Alexander Lang

Thomas Schaeck

Klaus Rindtorff

Roland Weber

Marcus Korn

Martin Will

Alexandra Liberman

Stefan Guessregen

The present invention relates to a conjugate comprising a sulfonamide of formula (I) and an active pharmaceutical ingredient such as an insulin analog comprising at least one mutation relative to the parent insulin, wherein the insulin analog comprises a mutation at position B16 which is substituted with a hydrophobic amino acid and/or a mutation at position B25 which is substituted with a hydrophobic amino acid. The present invention further relates to a sulfonamide of formula (A). Moreover, the present invention relates to an insulin analog comprising at least one mutation relative to the parent insulin.

Insulin conjugates

Embodiments of the present invention provide a method and system for processing a query on a set of data blocks in analytical databases. The query is on a set of data blocks, having at least one attribute and specifies at least one selection condition on the attribute. The selection condition is associated with at least one selection expression. Attribute value information on each attribute is generated for each data block. Next, a condition is generated on each attribute to negate the selection expression, if the selection expression has a negation operator. Additional conditions are generated for each selection expression that does not contain a negation operation. The attribute value is used to select the positive and negative subsets of data blocks for each condition. Next, a negative subset that does not require processing to evaluate the query is skipped and the positive subsets and the non-skipped negative subsets are processed.

Executing conditions with negation operators in analytical databases

Reorganizing a data table to improve analytical database performance. Attribute value information for data blocks of the data table is determined. One or more queries having respective query predicates involving the attribute may be received and processed. Data blocks having attribute value information matching a query predicate are selected. The selected data blocks are evaluated for the query predicate of the query. For each part of a set of the parts a false positive rate may be determined. The false positive rate may indicate the fraction of data blocks of the selected data blocks of the part, that each contains less than a determined maximum number of rows that satisfy the query predicate. In response to determining the false positive rate, determining a subset of parts including the sorted part that fit into a level of granularity higher than the selected level of granularity and sorting the subset of parts.

Reorganizing a data table to improve analytical database performance

A method for sorting a data table is provided. The method may include providing a plurality of attribute value information for each data block of the data table. The method may also include receiving a query requiring a sorting on the first attribute of the data table. The method may further include determining a plurality of sequences of a plurality of data blocks having disjoint value ranges of the first attribute based on the provided plurality of attribute value information. The method may also include, for each determined sequence of the plurality of data blocks, reading a plurality of data, sorting the read plurality of data from each data block, and concatenating the sorted plurality of data from the plurality of data blocks within the determined sequence, thereby providing a sorted plurality of sequences. The method may further include merging the sorted plurality of sequences.

Sorting tables in analytical databases

A present invention embodiment relates to inserting data to a data table, where the data table has multiple data records and involves at least one organizing attribute. The embodiment defines a set of data blocks having records of the data table and assigns to each data block of the set of data blocks a predefined maximum number of records of the data table or a predefined maximum amount of storage. Data records for each data block of the set of data blocks may be stored on a storage system. Further data records may be sorted based on values of the organizing attribute in the buffered data records. The sorted data records may be written on the storage system in their order. Attribute value information may be determined for the further data blocks for supporting query processing against the data table.

Bulk data insertion in analytical databases

The method may include providing a plurality of synopsis techniques for determining a plurality of attribute value information indicative of the at least one attribute. The method may include determining a data characteristic describing the plurality of data rows of the current data block. The method may include selecting, based on the determined data characteristic, at least one synopsis technique of the provided plurality of synopsis techniques suitable for generating the plurality of attribute value information for the at least one attribute of the current data block. The method may include determining the plurality of attribute value information for the at least one attribute of the plurality of data rows of the current data block using the at least one selected synopsis technique. The method may include storing the determined plurality of attribute value information for the current data block to be used for query processing against the data table.

Extreme value computation

Sorting and storing a dataset, the dataset comprising at least one attribute. The method includes defining a set of data blocks and assigning to each data block a predefined maximum number of entries or a predefined maximum amount of storage, dividing the dataset into a sequence of multiple sub-datasets each having one value or a range of values of the attribute, wherein each pair of successive sub-datasets of the sequence are non-overlapping or overlapping at their respective extremum value of the attribute, for each sub-dataset of the multiple sub-datasets: in case the sub-dataset fully or partially fits into a data block of the defined data blocks storing the sub-dataset into at least the data block, the sub-dataset that partially fits into the data block comprising a number of entries that is smaller than a predefined maximum threshold.

Dividing a dataset into sub-datasets having a subset of values of an attribute of the dataset

A method, computer program product, and system for processing attribute value information for a data set. The method, computer program product, and system includes receiving a first data query on the data set. The first data query includes a condition on at least one attribute of the data set. While processing the first data query, data blocks containing records of the data set may be scanned. The data blocks contain first data blocks that are full. Attribute value information may be generated for the at least one attribute for the first data blocks. The attribute value information may be stored and a second data query involving a condition on at least one of the at least one attribute may be processed using the stored attribute value information.

Dynamic column synopsis for analytical databases

A mechanism is provided for updating attribute value information for a data table. The data table involves a set of attributes. The data table has multiple records associated with multiple data blocks. Attribute value information is associated with each data block of the multiple data blocks. The attribute value information is descriptive of at least one attribute of the set of attributes. A first data block may be marked as modified in response to a delete process for deleting from a first data block of the multiple data blocks a record having at least one attribute value that is used for generating the attribute value information of the first data block. In response to scanning the marked first data block, the attribute value information associated with the first data block may be updated based on the scan results.

Self-maintaining effective value range synopsis in presence of deletes in analytical databases

A first data table and a second table to be joined is determined. The first data table and the second data table have a join attribute. Data blocks of the first data table are stored on a storage device. An attribute value information for the join attribute for the data block of the first data table is determined. At least one partition for the first data table and the second table is defined using at least the attribute value information on the join attribute. Each partition of the at least one partition has a respective partition range of values of the join attribute. A pair wise partition join is processed on a first partition range of the determined partition ranges.

Partitioned joins in analytical databases

Reorganizing a data table to improve analytical database performance is presented. Attribute value information for data blocks of the data table is determined. One or more queries having respective query predicates involving the attribute may be received and processed. Data blocks having attribute value information matching a query predicate are selected. The selected data blocks are evaluated for the query predicate of the query. For each part of a set of the parts a false positive rate may be determined. The false positive rate may indicate the fraction of data blocks of the selected data blocks of the part, that each contains less than a determined maximum number of rows that satisfy the query predicate. In response to determining for each part of the set of the parts that the determined false positive rates of the part meet a predefined condition sorting the part by the attribute.

Growing community of inventors

Boeblingen, Germany

Thomas F Boehme