Patents by Inventor Oliver Schiller
Oliver Schiller has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 11687546Abstract: 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.Type: GrantFiled: November 21, 2021Date of Patent: June 27, 2023Assignee: International Business Machines CorporationInventors: Thomas F. Boehme, Andreas Brodt, Daniel Martin, Oliver Schiller
-
Publication number: 20220358375Abstract: Inference results of a machine learning model and associated inputs are collected. An inference request is received. A determination is made whether a request input of the inference request matches at least one collected input of a set of collected inputs. In response to determining that the request input matches at least one collected input in the set of collected inputs, an inference result is determined using one or more collected inference results associated with said one or more matching inputs in the set of collected inputs.Type: ApplicationFiled: May 4, 2021Publication date: November 10, 2022Inventors: James Liam Finnie, Toni Bollinger, Oliver Schiller, Thomas Friedhelm Böhme, Tobias Kevin Fränzel
-
Publication number: 20220179861Abstract: A method, a computer program product, and a system for scheduling a first query execution plan for executing a first query for accessing first data sets of data of a relational database system (RDBS) and a second query execution plan for executing a second query for accessing second data sets of the data. The data is divided into data blocks of data sets of the data, wherein metadata of the RDBS comprises respective information about at least one property of the data sets of a respective data block of the data blocks. The scheduling may be performed on the basis of an examination if there is a common partition between a first partition of data blocks which may fulfill a first condition according to the first query and a second partition of data blocks which may fulfill a second condition according to the second query.Type: ApplicationFiled: December 8, 2020Publication date: June 9, 2022Inventors: Thomas Friedhelm Böhme, Oliver Schiller, James Liam Finnie, Ingo Schuster
-
Publication number: 20220075774Abstract: 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.Type: ApplicationFiled: November 21, 2021Publication date: March 10, 2022Inventors: Thomas F. Boehme, Andreas Brodt, Daniel Martin, Oliver Schiller
-
Patent number: 11238040Abstract: Attribute value information on data blocks of a data table is provided that indicates upper and lower bounds of extreme values for an attribute of the data table. In response to determining that processing of a received data table query involves grouping of records according to a grouping attribute, it is determined whether the attribute value information reflects upper and lower bounds of extreme values of the grouping attribute. If the attribute value information indicates the upper and lower bounds of extreme values of the grouping attribute, a scan list is determined that defines which data blocks are to be scanned in a determined scan order. A set of distinct value ranges of the grouping attribute is determined based on the scan order, the data blocks are scanned using the scan list, and the query is processed.Type: GrantFiled: May 28, 2019Date of Patent: February 1, 2022Assignee: International Business Machines CorporationInventors: Felix O. Beier, Andreas Brodt, Oliver Schiller
-
Patent number: 11188552Abstract: 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.Type: GrantFiled: November 25, 2019Date of Patent: November 30, 2021Assignee: International Business Machines CorporationInventors: Thomas F. Boehme, Andreas Brodt, Daniel Martin, Oliver Schiller
-
Patent number: 11176123Abstract: The present disclosure relates to a method for enforcing constraints on data in a data processing system. The method comprises providing a set of constraints on the data. A first data update request may be received at the transactional engine and executes on the first dataset. A second data update request associated with the received data update request is determined and sent by the transactional engine to the analytical engine. The analytical engine executes the second data, resulting in a set of changes in the second dataset. The transactional engine commits the update of the first dataset before or after receiving the results of the checking of the set of constraints. The update on the first dataset is aborted by the transactional engine in response to receiving the results of the checking of the set of constraints, wherein the results indicate that the set of constraints are not met.Type: GrantFiled: December 10, 2019Date of Patent: November 16, 2021Assignee: International Business Machines CorporationInventors: Daniel Martin, Andreas Brodt, Oliver Schiller, Felix Beier, Knut Stolze
-
Patent number: 11151144Abstract: 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.Type: GrantFiled: July 30, 2019Date of Patent: October 19, 2021Assignee: International Business Machines CorporationInventors: Thomas F. Boehme, Andreas Brodt, Daniel Martin, Oliver Schiller
-
Patent number: 11074242Abstract: 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.Type: GrantFiled: April 2, 2019Date of Patent: July 27, 2021Assignee: International Business Machines CorporationInventors: Thomas F. Boehme, Andreas Brodt, Oliver Schiller
-
Patent number: 10936594Abstract: A method, a computer program product and a computer system are provided. Attribute value information contains at least a minimum value representing a smallest value of a first attribute and a maximum value representing a largest value of the first attribute, thereby defining a first range of values of the first attribute. A received query against a data table requests one or more values of at least the first attribute that are covered by the first range of values. The attribute value information may be used for selecting a data block of the data table as a candidate potentially including at least part of the requested one or more values and scanning the data block. In response to determining that the data block does not include the one or more requested values, the attribute value information may be updated accordingly.Type: GrantFiled: January 2, 2018Date of Patent: March 2, 2021Assignee: International Business Machines CorporationInventors: Felix O. Beier, Andreas Brodt, Namik Hrle, Oliver Schiller
-
Patent number: 10929400Abstract: A method, a computer program product and a computer system are provided. Attribute value information contains at least a minimum value representing a smallest value of a first attribute and a maximum value representing a largest value of the first attribute, thereby defining a first range of values of the first attribute. A received query against a data table requests one or more values of at least the first attribute that are covered by the first range of values. The attribute value information may be used for selecting a data block of the data table as a candidate potentially including at least part of the requested one or more values and scanning the data block. In response to determining that the data block does not include the one or more requested values, the attribute value information may be updated accordingly.Type: GrantFiled: October 26, 2016Date of Patent: February 23, 2021Assignee: International Business Machines CorporationInventors: Felix O. Beier, Andreas Brodt, Namik Hrle, Oliver Schiller
-
Patent number: 10915533Abstract: 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.Type: GrantFiled: February 15, 2019Date of Patent: February 9, 2021Assignee: International Business Machines CorporationInventors: Felix O. Beier, Thomas F. Boehme, Andreas Brodt, Oliver Schiller
-
Patent number: 10915534Abstract: 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.Type: GrantFiled: February 15, 2019Date of Patent: February 9, 2021Assignee: International Business Machines CorporationInventors: Felix O. Beier, Thomas F. Boehme, Andreas Brodt, Oliver Schiller
-
Patent number: 10884704Abstract: A computer-implemented method, a system, and a computer program product for sorting a data table by an attribute of the data table is provided. Each data block of the data table is provided with attribute value information being indicative of distinct values and/or ranges of values of the attribute in each of the data blocks of the data table. Distinct ranges and/or distinct values of the attribute of the data table are derived from the attribute value information. For each determined distinct range and/or distinct value, a bucket may be created. For each created bucket, it may be determined, using the attribute value information, which data block of the data table is to be scanned. Each scanned record is distributed to a corresponding bucket. The entries or records in each bucket having more than one record, may be sorted by the attribute.Type: GrantFiled: September 21, 2017Date of Patent: January 5, 2021Assignee: International Business Machines CorporationInventors: Felix Beier, Andreas Brodt, Oliver Schiller, Knut Stolze
-
Patent number: 10783115Abstract: 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.Type: GrantFiled: June 12, 2018Date of Patent: September 22, 2020Assignee: International Business Machines CorporationInventors: Thomas F. Boehme, Andreas Brodt, Namik Hrle, Oliver Schiller
-
Patent number: 10678784Abstract: 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.Type: GrantFiled: January 4, 2018Date of Patent: June 9, 2020Assignee: International Business Machines CorporationInventors: Thomas F. Boehme, Andreas Brodt, Oliver Koeth, Oliver Schiller
-
Patent number: 10671592Abstract: 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.Type: GrantFiled: January 26, 2018Date of Patent: June 2, 2020Assignee: International Business Machines CorporationInventors: Thomas F. Boehme, Andreas Brodt, Alexander Lang, Oliver Schiller
-
Patent number: 10664464Abstract: 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.Type: GrantFiled: October 17, 2016Date of Patent: May 26, 2020Assignee: International Business Machines CorporationInventors: Thomas F. Boehme, Andreas Brodt, Alexander Lang, Oliver Schiller
-
Patent number: 10628425Abstract: 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.Type: GrantFiled: September 21, 2017Date of Patent: April 21, 2020Assignee: International Business Machines CorporationInventors: Thomas F. Boehme, Andreas Brodt, Daniel Martin, Oliver Schiller
-
Patent number: 10621174Abstract: 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.Type: GrantFiled: September 21, 2018Date of Patent: April 14, 2020Assignee: International Business Machines CorporationInventors: Thomas Boehme, Andreas Brodt, Oliver Koeth, Oliver Schiller