Patents by Inventor Julian Schwing
Julian Schwing 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: 11893026Abstract: A calculation engine of a database management system is described that determines a multiprovider includes a first data source and a second data source that each require different approaches for operation optimization. The calculation engine can split the multiprovider into a first node corresponding to a first operation compatible with the first data source and a second node corresponding to a second operation compatible with the second data source. The calculation engine can perform the first operation at the first data source to produce a first result and perform the second operation at the second data source to produce a second result. The calculation engine can then merge the first result and the second result according to a third operation, and perform such third operation at the first data source.Type: GrantFiled: April 2, 2019Date of Patent: February 6, 2024Assignee: SAP SEInventors: Julian Schwing, Christoph Weyerhaeuser, Johannes Merx, Davide Corradi, Timo Hochberger
-
Patent number: 11455308Abstract: Described herein includes a calculation scenario of a calculation engine that efficiently partitions data for processing at separate hosts, including in parallel, and unions intermediate results from such separate processing when required for further processing. Such parallel processing of partitions can allow for faster processing times, and such unioning of data only when required for further processing can limit the transferring of data that results in slower processing.Type: GrantFiled: November 17, 2016Date of Patent: September 27, 2022Assignee: SAP SEInventors: Julian Schwing, Johannes Merx, Christoph Weyerhaeuser
-
Patent number: 11372863Abstract: A calculation engine of a database management system is described. The calculation engine may receive a query associated with a calculation scenario that defines a data flow model. The data flow model may include one or more calculation nodes, each of which corresponding to an operation performed on one or more database tables stored at a database. The one or more calculation nodes may include at least one calculation node corresponding to a ranking filter operation. The calculation engine may execute the query including by executing the calculation scenario. The executing of the calculation scenario may include performing the ranking filter operation to generate a result corresponding to at least a portion of rows included in a first partition of a database table stored at the database. Related systems, methods, and articles of manufacture are provided.Type: GrantFiled: December 11, 2019Date of Patent: June 28, 2022Assignee: SAP SEInventors: Michael Ludwig, Johannes Merx, Christoph Weyerhaeuser, Julian Schwing
-
Patent number: 11188540Abstract: Described herein includes a calculation scenario of a calculation engine that efficiently filters and joins data for processing. The calculation engine enhances the performance of the join operations by allowing join inputs to be pre-filtered more effectively. Such join operations can allow for faster processing times, and a reduction in the amount of data to be joined, resulting in more efficient processing.Type: GrantFiled: April 4, 2018Date of Patent: November 30, 2021Assignee: SAP SEInventors: Alena Bakulina, Johannes Merx, Julian Schwing, Christoph Weyerhaeuser
-
Patent number: 11113285Abstract: Described herein includes a calculation scenario of a calculation engine that efficiently partitions data for processing at separate hosts, including in parallel, and unions intermediate results from such separate processing when required for further processing. Such parallel processing of partitions can allow for faster processing times, and such unioning of data only when required for further processing can limit the transferring of data that results in slower processing.Type: GrantFiled: April 4, 2018Date of Patent: September 7, 2021Assignee: SAP SEInventors: Davide Corradi, Johannes Merx, Julian Schwing, Christoph Weyerhaeuser
-
Patent number: 11106666Abstract: A query that requests a filter attribute is received by a database server from a remote application server that is associated with at least one calculation scenario that includes calculation nodes having relational operators and calculation nodes having non-relational operators. The calculation nodes having relational or non-relational operators are optimized by a calculation engine model optimizer and the calculation nodes having relational operators are further optimized by a relational database optimizer. Thereafter, the operations defined by the optimized calculation nodes can be executed to result in a responsive data set. Next, the data set is provided to the application server by the database server.Type: GrantFiled: May 28, 2015Date of Patent: August 31, 2021Assignee: SAP SEInventors: Christoph Weyerhaeuser, Tobias Mindnich, Johannes Merx, Julian Schwing
-
Publication number: 20210182299Abstract: A calculation engine of a database management system is described. The calculation engine may receive a query associated with a calculation scenario that defines a data flow model. The data flow model may include one or more calculation nodes, each of which corresponding to an operation performed on one or more database tables stored at a database. The one or more calculation nodes may include at least one calculation node corresponding to a ranking filter operation. The calculation engine may execute the query including by executing the calculation scenario. The executing of the calculation scenario may include performing the ranking filter operation to generate a result corresponding to at least a portion of rows included in a first partition of a database table stored at the database. Related systems, methods, and articles of manufacture are provided.Type: ApplicationFiled: December 11, 2019Publication date: June 17, 2021Inventors: Michael Ludwig, Johannes Merx, Christoph Weyerhaeuser, Julian Schwing
-
Patent number: 11023468Abstract: Methods and apparatus, including computer program products, are provided for first and last aggregation. In one aspect, there is provided a method, which may include receiving, by a calculation engine, a query; detecting, by the calculation engine, whether the query includes a first aggregation and/or a last aggregation over at least one group and at least one keyfigure; optimizing the received query, when the detecting indicates the received query includes the first aggregation and/or the last aggregation, wherein the optimizing further comprises initiating execution of the received query by at least: performing a single read of a table, detecting, from the single table read, at least one group, and indicating, in the detected at least one group, the first aggregation in the at least one keyfigure and/or the last aggregation in the at least one keyfigure; and returning, for the at least one detected group, the indicated first aggregation and/or the indicated second aggregation.Type: GrantFiled: November 20, 2015Date of Patent: June 1, 2021Assignee: SAP SEInventors: Christoph Weyerhaeuser, Tobias Mindnich, Johannes Merx, Julian Schwing
-
Patent number: 10831784Abstract: A calculation engine of a database management system is described. In some implementations, the calculation engine receives a calculation scenario including a plurality of calculation views comprising one or more relational operations. The calculation engine determines whether a first calculation view includes a second calculation view configured as an operand of one of the relational operations of the first calculation view, and also determines whether the second calculation view comprises a non-relational operation. The calculation engine further converts the plurality of calculation views into a calculation plan via merging the first calculation view with the second calculation view when the first calculation view is determined to comprise the second calculation view as an operand, and replacing the second calculation view with a view search operation when the second calculation view is determined to comprise the non-relational operation.Type: GrantFiled: May 9, 2016Date of Patent: November 10, 2020Assignee: SAP SEInventors: Julian Schwing, Johannes Merx, Christoph Weyerhaeuser
-
Publication number: 20200320082Abstract: A calculation engine of a database management system is described that determines a multiprovider includes a first data source and a second data source that each require different approaches for operation optimization. The calculation engine can split the multiprovider into a first node corresponding to a first operation compatible with the first data source and a second node corresponding to a second operation compatible with the second data source. The calculation engine can perform the first operation at the first data source to produce a first result and perform the second operation at the second data source to produce a second result. The calculation engine can then merge the first result and the second result according to a third operation, and perform such third operation at the first data source.Type: ApplicationFiled: April 2, 2019Publication date: October 8, 2020Inventors: Julian Schwing, Christoph Weyerhaeuser, Johannes Merx, Davide Corradi, Timo Hochberger
-
Patent number: 10713244Abstract: A calculation engine of a database management system is described. In some implementations, the calculation engine receives a calculation scenario including a plurality of join operations defining an intersection between at least two nodes. The calculation engine optimizes a first join which is of a certain cardinality, and for which no attributes are requested, other than a join attribute. The optimization includes determining whether a static filter is present for a first node or a second node of the first join, and pruning the first node and/or the second node from the hierarchical join when the attribute is not requested from the first node or the second node and/or when the static filter is not present for the first node or the second node. Related systems, methods, and articles of manufacture are also described.Type: GrantFiled: May 9, 2016Date of Patent: July 14, 2020Assignee: SAP SEInventors: Julian Schwing, Johannes Merx, Christoph Weyerhaeuser
-
Patent number: 10628418Abstract: According to an aspect, a system includes a query engine configured to obtain a multi-provider query model for a query specifying a filter to be applied on provider partitions. The obtained multi-provider query model incorporates a pruning plan. The query engine includes a query optimizer configured to execute the pruning plan during optimization of the multi-provider query model. The pruning plan determines if each of the provider partitions includes content that is required to execute the filter based on pruning information. The query optimizer configured to reduce a scope of the query by excluding at least one provider partition that is determined as not required to execute the filter.Type: GrantFiled: November 13, 2014Date of Patent: April 21, 2020Assignee: SAP SEInventors: Christoph Weyerhaeuser, Tobias Mindnich, Johannes Merx, Joerg Schad, Julian Schwing, Daniel Patejdl
-
Patent number: 10558652Abstract: A method may include executing a calculation scenario at a database. The calculation scenario may include a parent multiprovider aggregating data from a child multiprovider. The calculation scenario may be executed by mapping a first count keyfigure of the child multiprovider to a first sum keyfigure of the parent multiprovider if the child multiprovider aggregates data from part providers but not from multiproviders. A second sum keyfigure of the child multiprovider may be mapped to the first sum keyfigure of the parent multiprovider if the child multiprovider aggregates data from multiproviders but not from any part providers. The first count keyfigure of the child multiprovider may be mapped to a second count keyfigure of the parent multiprovider and the second sum keyfigure of the child multiprovider may be mapped to the first sum keyfigure of the parent multiprovider if the child multiprovider aggregates data from part providers and multiproviders.Type: GrantFiled: July 14, 2017Date of Patent: February 11, 2020Assignee: SAP SEInventors: Julian Schwing, Johannes Merx, Christoph Weyerhaeuser
-
Patent number: 10552388Abstract: Described herein includes finding and replacing, including automatically, at least one null value in a table for allowing processing of the table with an ABAP-based application. In some implementations, the null values are replaced with replacement values that are compatible with further processing of the data in the table. For example, a replacement value can be a string providing information or a value, such as for performing a calculation.Type: GrantFiled: January 10, 2017Date of Patent: February 4, 2020Assignee: SAP SEInventors: Davide Corradi, Daniel Patejdl, Christoph Weyerhaeuser, Johannes Merx, Julian Schwing
-
Patent number: 10452659Abstract: Described herein includes processing various instruction sets configured for online analytics processing (OLAP) using a calculation engine. This allows OLAP configured instruction sets or calculation scenarios to be efficiently and effectively processed with the calculation engine during run time thereby preventing delays and errors during processing.Type: GrantFiled: January 23, 2017Date of Patent: October 22, 2019Assignee: SAP SEInventors: Berthold Von Haaren, Christoph Weyerhaeuser, Johannes Merx, Julian Schwing
-
Publication number: 20190311058Abstract: Described herein includes a calculation scenario of a calculation engine that efficiently partitions data for processing at separate hosts, including in parallel, and unions intermediate results from such separate processing when required for further processing. Such parallel processing of partitions can allow for faster processing times, and such unioning of data only when required for further processing can limit the transferring of data that results in slower processing.Type: ApplicationFiled: April 4, 2018Publication date: October 10, 2019Inventors: Davide Corradi, Johannes Merx, Julian Schwing, Christoph Weyerhaeuser
-
Publication number: 20190311059Abstract: Described herein includes a calculation scenario of a calculation engine that efficiently filters and joins data for processing. The calculation engine enhances the performance of the join operations by allowing join inputs to be pre-filtered more effectively. Such join operations can allow for faster processing times, and a reduction in the amount of data to be joined, resulting in more efficient processing.Type: ApplicationFiled: April 4, 2018Publication date: October 10, 2019Inventors: Alena Bakulina, Johannes Merx, Julian Schwing, Christoph Weyerhaeuser
-
Patent number: 10324930Abstract: A query is received by a database server from a remote application server that is associated with a calculation scenario that defines a data flow model including one or more calculation nodes including stacked multiproviders. Subsequently, the database server instantiates the calculation scenario and afterwards optimizes the calculation scenario. As part of the optimization, the calculation scenario is optimized by merging the two multiproviders. Thereafter, the operations defined by the calculation nodes of the optimized calculation scenario can be executed to result in a responsive data set. Next, the data set is provided to the application server by the database server.Type: GrantFiled: May 27, 2015Date of Patent: June 18, 2019Assignee: SAP SEInventors: Christoph Weyerhaeuser, Tobias Mindnich, Johannes Merx, Julian Schwing, Daniel Patejdl, Isil Pekel
-
Patent number: 10324927Abstract: Methods and apparatus, including computer program products, are provided for union node pruning. In one aspect, there is provided a method, which may include receiving, by a calculation engine, a query; processing a calculation scenario including a union node; accessing a pruning table associated with the union node, wherein the pruning table includes semantic information describing the first input from the first data source node and the second input from the second data source node; determining whether the first data source node and the second data source node can be pruned by at least comparing the semantic information to at least one filter of the query; and pruning, based on a result of the determining, at least one the first data source node or the second data source node. Related apparatus, systems, methods, and articles are also described.Type: GrantFiled: November 19, 2015Date of Patent: June 18, 2019Assignee: SAP SEInventors: Tobias Mindnich, Julian Schwing, Christoph Weyerhaeuser, Isil Pekel, Johannes Merx, Alena Bakulina
-
Patent number: 10255316Abstract: A database server receives a request to perform a primary query on a table of a database. A first table query can be generated and can include a starting row identifier, ROW A, and a number of rows, n, for generating a data chunk from the table of the database. Multiple table queries can be performed each having a different starting row identifier and each defining the number of rows forming a data chunk. The primary query can be extended with the first table query in preparation for performing the primary query on the first data chunk.Type: GrantFiled: November 18, 2015Date of Patent: April 9, 2019Assignee: SAP SEInventors: Christoph Weyerhaeuser, Alena Bakulina, Tobias Mindnich, Johannes Merx, Julian Schwing