Patents by Inventor Daniel Patejdl

Daniel Patejdl 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: 10628418
    Abstract: 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: Grant
    Filed: November 13, 2014
    Date of Patent: April 21, 2020
    Assignee: SAP SE
    Inventors: Christoph Weyerhaeuser, Tobias Mindnich, Johannes Merx, Joerg Schad, Julian Schwing, Daniel Patejdl
  • Patent number: 10552388
    Abstract: 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: Grant
    Filed: January 10, 2017
    Date of Patent: February 4, 2020
    Assignee: SAP SE
    Inventors: Davide Corradi, Daniel Patejdl, Christoph Weyerhaeuser, Johannes Merx, Julian Schwing
  • Patent number: 10324930
    Abstract: 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: Grant
    Filed: May 27, 2015
    Date of Patent: June 18, 2019
    Assignee: SAP SE
    Inventors: Christoph Weyerhaeuser, Tobias Mindnich, Johannes Merx, Julian Schwing, Daniel Patejdl, Isil Pekel
  • Patent number: 10275490
    Abstract: A database server receives a query from a remote application server that is associated with a calculation scenario. The calculation scenario defines a data flow model that includes one or more calculation nodes that each define one or more operations to execute on the database server. A top operator node of the calculation nodes specifies a plurality of attributes and the query requests a subset of the attributes specified by the top operator node; Thereafter, the database server instantiates the calculation scenario so that it is optimized by requesting only the subset of attributes. The database server then executes the operations defined by the calculation nodes of the optimized calculation scenario to result in a responsive data set. The database server then provides the data set to the application server.
    Type: Grant
    Filed: January 28, 2015
    Date of Patent: April 30, 2019
    Assignee: SAP SE
    Inventors: Christoph Weyerhaeuser, Tobias Mindnich, Isil Pekel, Johannes Merx, Daniel Patejdl
  • Patent number: 10067980
    Abstract: A calculation engine is described that executes calculation scenarios comprising a plurality of calculation nodes that specify operations to be performed to execute the query. One of the nodes can be a semantic node that is used to modify the query for operations requiring special handling including handling of hierarchy views. Related apparatus, systems, methods, and articles are also described.
    Type: Grant
    Filed: June 16, 2015
    Date of Patent: September 4, 2018
    Assignee: SAP SE
    Inventors: Christoph Weyerhaeuser, Tobias Mindnich, Johannes Merx, Julian Schwing, Daniel Patejdl
  • Publication number: 20180196833
    Abstract: 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: Application
    Filed: January 10, 2017
    Publication date: July 12, 2018
    Inventors: Davide Corradi, Daniel Patejdl, Christoph Weyerhaeuser, Johannes Merx, Julian Schwing
  • Publication number: 20160371330
    Abstract: A calculation engine is described that executes calculation scenarios comprising a plurality of calculation nodes that specify operations to be performed to execute the query. One of the nodes can be a semantic node that is used to modify the query for operations requiring special handling including handling of hierarchy views. Related apparatus, systems, methods, and articles are also described.
    Type: Application
    Filed: June 16, 2015
    Publication date: December 22, 2016
    Inventors: Christoph Weyerhaeuser, Tobias Mindnich, Johannes Merx, Julian Schwing, Daniel Patejdl
  • Publication number: 20160350374
    Abstract: 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: Application
    Filed: May 27, 2015
    Publication date: December 1, 2016
    Inventors: Christoph Weyerhaeuser, Tobias Mindnich, Johannes Merx, Julian Schwing, Daniel Patejdl, Isil Pekel
  • Publication number: 20160217210
    Abstract: A database server receives a query from a remote application server that is associated with a calculation scenario. The calculation scenario defines a data flow model that includes one or more calculation nodes that each define one or more operations to execute on the database server. A top operator node of the calculation nodes specifies a plurality of attributes and the query requests a subset of the attributes specified by the top operator node; Thereafter, the database server instantiates the calculation scenario so that it is optimized by requesting only the subset of attributes. The database server then executes the operations defined by the calculation nodes of the optimized calculation scenario to result in a responsive data set. The database server then provides the data set to the application server.
    Type: Application
    Filed: January 28, 2015
    Publication date: July 28, 2016
    Inventors: Christoph Weyerhaeuser, Tobias Mindnich, Isil Pekel, Johannes Merx, Daniel Patejdl
  • Publication number: 20160140174
    Abstract: 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: Application
    Filed: November 13, 2014
    Publication date: May 19, 2016
    Inventors: Christoph Weyerhaeuser, Tobias Mindnich, Johannes Merx, Joerg Schad, Julian Schwing, Daniel Patejdl
  • Patent number: 9037570
    Abstract: A query associated with a calculation scenario comprising a plurality of calculation nodes can be received by a calculation engine. The calculation scenario is instantiated and the query is transformed into a convex hull filter based on the at least one multiple selection condition that can be executed at any of the calculation nodes. The instantiated calculation scenario and the convex hull filter are executed to provide a result set. Related apparatus, systems, methods, and articles are also described.
    Type: Grant
    Filed: June 10, 2013
    Date of Patent: May 19, 2015
    Assignee: SAP SE
    Inventors: Christoph Weyerhaeuser, Tobias Mindnich, Daniel Baeumges, Johannes Merx, Daniel Patejdl
  • Publication number: 20140365465
    Abstract: A query associated with a calculation scenario comprising a plurality of calculation nodes can be received by a calculation engine. The calculation scenario is instantiated and the query is transformed into a convex hull filter based on the at least one multiple selection condition that can be executed at any of the calculation nodes. The instantiated calculation scenario and the convex hull filter are executed to provide a result set. Related apparatus, systems, methods, and articles are also described.
    Type: Application
    Filed: June 10, 2013
    Publication date: December 11, 2014
    Inventors: Christoph Weyerhaeuser, Tobias Mindnich, Daniel Baeumges, Johannes Merx, Daniel Patejdl