Patents by Inventor Stefan Baeuerle

Stefan Baeuerle 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).

  • Publication number: 20220292099
    Abstract: Techniques and solutions are described for implementing virtual table schemas. A virtual table schema includes a logical pointer that is used to target a table that includes data and is defined according to the virtual table schema. Values assigned to the logical pointer can be used to target tables at different locations, such as in-memory storage or in dynamic storage of a database management system. The dynamic storage includes an in-memory buffer cache and persistent storage. The logical pointer can be updated to point to the in-memory storage or the dynamic storage, including based on use statistics. Similarly, a table having data for the virtual table can be transitioned between the in-memory buffer cache and the persistent storage, including based on use statistics for the virtual table. A value for the logical pointer can be updated when the table is transferred between the in-memory buffer cache and the dynamic storage.
    Type: Application
    Filed: June 2, 2022
    Publication date: September 15, 2022
    Applicant: SAP SE
    Inventors: Ruediger Karl, Mihnea Andrei, Juchang Lee, Stefan Baeuerle, Seyeong Bae, Joo Yeon Lee
  • Patent number: 11416485
    Abstract: Implementations of the present disclosure include receiving a query, the query including an expression macro (EM), processing the query to provide a raw parse tree, the raw parse tree including an initial node representative of the EM, retrieving metadata corresponding to the EM, the metadata including a definition string, replacing the initial node with a node based on the definition string to provide a consumable parse tree, and executing the query within the database system using the consumable parse tree to provide a query result.
    Type: Grant
    Filed: March 28, 2019
    Date of Patent: August 16, 2022
    Assignee: SAP SE
    Inventors: Zhi Qiao, Stefan Baeuerle, Ki Hong Kim, Florian Scheid, Timm Falter, Andreas Balzar, Di Wu
  • Patent number: 11379486
    Abstract: Techniques and solutions are described for implementing virtual table schemas. A virtual table schema includes a logical pointer that is used to target a table that includes data and is defined according to the virtual table schema. Values assigned to the logical pointer can be used to target tables at different locations, such as in-memory storage or in dynamic storage of a database management system. The dynamic storage includes an in-memory buffer cache and persistent storage. The logical pointer can be updated to point to the in-memory storage or the dynamic storage, including based on use statistics. Similarly, a table having data for the virtual table can be transitioned between the in-memory buffer cache and the persistent storage, including based on use statistics for the virtual table. A value for the logical pointer can be updated when the table is transferred between the in-memory buffer cache and the dynamic storage.
    Type: Grant
    Filed: December 13, 2019
    Date of Patent: July 5, 2022
    Assignee: SAP SE
    Inventors: Ruediger Karl, Mihnea Andrei, Juchang Lee, Stefan Baeuerle, Seyeong Bae, Joo Yeon Lee
  • Publication number: 20220197922
    Abstract: Techniques and solutions are described for implementing virtual table schemas. A virtual table schema includes a logical pointer that is used to target a table that includes data and is defined according to the virtual table schema. Values assigned to the logical pointer can be used to target tables at different locations, such as in a federated database system or in a cache of a database management system of a central computing system. When data associated with the virtual table is requested, or prior to receiving the request, the data can be stored in a table in the cache. The logical pointer can be updated to reference the cache. If the cache is full, the table can be removed from the cache, and the logical pointer can be updated to reference a table at the federated database system.
    Type: Application
    Filed: January 4, 2022
    Publication date: June 23, 2022
    Applicant: SAP SE
    Inventors: Ruediger Karl, Mihnea Andrei, Juchang Lee, Stefan Baeuerle, Seyeong Bae, Joo Yeon Lee
  • Patent number: 11360977
    Abstract: Implementations of the present disclosure include receiving, by a query processing server, a first query, the first query including a syntax indicating that precision loss is allowed, processing, by the query processing server, the first query to provide a first QEP, optimization of which would result in precision loss in a generated query result, determining that the syntax is provided, and in response, optimizing the first QEP to provide an optimized QEP, executing the optimized QEP to generate a query result that includes data stored within a database system, the query result having reduced accuracy relative to a query result that would be generated based on the first QEP, and providing the query result as output from the database system.
    Type: Grant
    Filed: April 1, 2019
    Date of Patent: June 14, 2022
    Assignee: SAP SE
    Inventors: Johannes Merx, Taehyung Lee, Sung Heun Wi, Jin Uk Bae, Ki Hong Kim, Stefan Baeuerle, Florian Scheid
  • Patent number: 11321344
    Abstract: Techniques and solutions are described for implementing virtual table schemas. A virtual table schema includes a logical pointer that is used to target a table that includes data and is defined according to the virtual table schema. Values assigned to the logical pointer can be used to target tables at different locations, such as in a federated database system or in a cache of a database management system of a central computing system. When data associated with the virtual table is requested, or prior to receiving the request, the data can be stored in a table in the cache. The logical pointer can be updated to reference the cache. If the cache is full, the table can be removed from the cache, and the logical pointer can be updated to reference a table at the federated database system.
    Type: Grant
    Filed: December 13, 2019
    Date of Patent: May 3, 2022
    Assignee: SAP SE
    Inventors: Ruediger Karl, Mihnea Andrei, Juchang Lee, Stefan Baeuerle, Seyeong Bae, Joo Yeon Lee
  • Publication number: 20210314273
    Abstract: Methods and systems for generating and executing a database process are described. One example method includes receiving a request at the virtual server according to the infrastructure protocol, the infrastructure protocol configured to perform actions on virtual server resources; determining an application associated with the request; and performing one or more actions associated with the request using a set of application resources associated with the application.
    Type: Application
    Filed: June 21, 2021
    Publication date: October 7, 2021
    Inventors: Nadav Binyamin Helfman, Chaim Bendelac, Stefan Baeuerle, Eran Ben Dror
  • Patent number: 11106698
    Abstract: A method, a system and a computer program product for executing management of ownership of data. An index in a plurality of indexes is selected. The index corresponds to a plurality of ranges of data values stored in a plurality of database slices of a database. The index further corresponds to a partitioning structure that includes a plurality of hierarchically arranged nodes. Each node corresponds to a range of data values stored in at least one database slice. The structure is replicated across a plurality of computing systems. A computing system executes an update to one or more ranges of data values. The system replicates at least one of a database slice including the updated ranges of data values and a node that includes the updated ranges of data values to another computing system for storage of a replicate of the updated ranges of data values.
    Type: Grant
    Filed: June 11, 2019
    Date of Patent: August 31, 2021
    Assignee: SAP SE
    Inventors: Christian Bensberg, Stefan Baeuerle
  • Publication number: 20210089540
    Abstract: Techniques and solutions are described for implementing virtual table schemas. A virtual table schema includes a logical pointer that is used to target a table that includes data and is defined according to the virtual table schema. Values assigned to the logical pointer can be used to target tables at different locations, such as in-memory storage or in dynamic storage of a database management system. The dynamic storage includes an in-memory buffer cache and persistent storage. The logical pointer can be updated to point to the in-memory storage or the dynamic storage, including based on use statistics. Similarly, a table having data for the virtual table can be transitioned between the in-memory buffer cache and the persistent storage, including based on use statistics for the virtual table. A value for the logical pointer can be updated when the table is transferred between the in-memory buffer cache and the dynamic storage.
    Type: Application
    Filed: December 13, 2019
    Publication date: March 25, 2021
    Applicant: SAP SE
    Inventors: Ruediger Karl, Mihnea Andrei, Juchang Lee, Stefan Baeuerle, Seyeong Bae, Joo Yeon Lee
  • Publication number: 20210089550
    Abstract: Techniques and solutions are described for implementing virtual table schemas. A virtual table schema includes a logical pointer that is used to target a table that includes data and is defined according to the virtual table schema. Values assigned to the logical pointer can be used to target tables at different locations, such as in a federated database system or in a cache of a database management system of a central computing system. When data associated with the virtual table is requested, or prior to receiving the request, the data can be stored in a table in the cache. The logical pointer can be updated to reference the cache. If the cache is full, the table can be removed from the cache, and the logical pointer can be updated to reference a table at the federated database system.
    Type: Application
    Filed: December 13, 2019
    Publication date: March 25, 2021
    Applicant: SAP SE
    Inventors: Ruediger Karl, Mihnea Andrei, Juchang Lee, Stefan Baeuerle, Seyeong Bae, Joo Yeon Lee
  • Publication number: 20210089552
    Abstract: Techniques and solutions are described for implementing virtual table schemas. A virtual table schema includes a logical pointer that is used to target a table that includes data and is defined according to the virtual table schema. Values assigned to the logical pointer can be used to target tables at different locations, such as tables located in a remote database system, replica tables containing data replicated from a table in a remote database system, or cached table data. Replica tables targeted by a logical pointer of a virtual table schema can have various locations, such as being located in main memory of a database system, being located in a dynamic storage system, or being located in a data lake. Replica tables can be transferred between locations based on various criteria.
    Type: Application
    Filed: December 13, 2019
    Publication date: March 25, 2021
    Applicant: SAP SE
    Inventors: Ruediger Karl, Mihnea Andrei, Juchang Lee, Stefan Baeuerle, Seyeong Bae, Joo Yeon Lee
  • Publication number: 20200394209
    Abstract: A method, a system and a computer program product for executing management of ownership of data. An index in a plurality of indexes is selected. The index corresponds to a plurality of ranges of data values stored in a plurality of database slices of a database. The index further corresponds to a partitioning structure that includes a plurality of hierarchically arranged nodes. Each node corresponds to a range of data values stored in at least one database slice. The structure is replicated across a plurality of computing systems. A computing system executes an update to one or more ranges of data values. The system replicates at least one of a database slice including the updated ranges of data values and a node that includes the updated ranges of data values to another computing system for storage of a replicate of the updated ranges of data values.
    Type: Application
    Filed: June 11, 2019
    Publication date: December 17, 2020
    Inventors: Christian Bensberg, Stefan Baeuerle
  • Patent number: 10838959
    Abstract: A method can include: generating a query execution plan for a query including a plurality of operations that operate on data from a relational database and data from a non-structured query language (NoSQL) database, the generating comprising optimizing the query by: identifying a first operation that operate on data from the relational database and an intermediate result output by a second operation, the second operation outputting the intermediate result by operating on the data from the NoSQL database; and determining a fixed datatype for the intermediate result, an indication of the fixed datatype being included in the query execution plan; and executing, based on the query execution plan, the query, the executing of the query comprising converting the intermediate result to the fixed datatype, the converting enabling the first operation to operate on the intermediate result output by the second operation along with the data from the relational database.
    Type: Grant
    Filed: April 10, 2017
    Date of Patent: November 17, 2020
    Assignee: SAP SE
    Inventors: Jin Uk Bae, Stefan Baeuerle, Christian Bensberg, Steffen Geissinger, Ki Hong Kim, Taehyung Lee, Jaeyun Noh, Di Wu, Long Zhang
  • Publication number: 20200311081
    Abstract: Implementations of the present disclosure include receiving, by a query processing server, a first query, the first query including a syntax indicating that precision loss is allowed, processing, by the query processing server, the first query to provide a first QEP, optimization of which would result in precision loss in a generated query result, determining that the syntax is provided, and in response, optimizing the first QEP to provide an optimized QEP, executing the optimized QEP to generate a query result that includes data stored within a database system, the query result having reduced accuracy relative to a query result that would be generated based on the first QEP, and providing the query result as output from the database system.
    Type: Application
    Filed: April 1, 2019
    Publication date: October 1, 2020
    Inventors: Johannes Merx, Taehyung Lee, Sung Heun Wi, Jin Uk Bae, Ki Hong Kim, Stefan Baeuerle, Florian Scheid
  • Publication number: 20200311078
    Abstract: Implementations of the present disclosure include receiving a query, the query including an expression macro (EM), processing the query to provide a raw parse tree, the raw parse tree including an initial node representative of the EM, retrieving metadata corresponding to the EM, the metadata including a definition string, replacing the initial node with a node based on the definition string to provide a consumable parse tree, and executing the query within the database system using the consumable parse tree to provide a query result.
    Type: Application
    Filed: March 28, 2019
    Publication date: October 1, 2020
    Inventors: Zhi Qiao, Stefan Baeuerle, Ki Hong Kim, Florian Scheid, Timm Falter, Andreas Balzar, Di Wu
  • Patent number: 10713284
    Abstract: A system includes reception of a first query at a first host, determination, at the first host, that the first query is associated with a first table, the first table including geographically-restricted data and a partitioning column storing identifiers of geographic restrictions, determination, at the first host and based on the partitioning column of the first table and on the first query, a first partition of the first table and a storage location of the first partition, and execution of the first query at the first host in conjunction with the storage location of the first partition.
    Type: Grant
    Filed: July 6, 2016
    Date of Patent: July 14, 2020
    Assignee: SAP SE
    Inventors: Christian Bensberg, Stefan Baeuerle, Frank Renkes, Torsten Strahl, Alexander Boehm
  • Patent number: 10599650
    Abstract: A system, medium, and method to define a database table and view based on a database model using a database language statement, the database language statement including a statement to create the table and a forward-declared JOIN statement that names the table and view, respectively and includes information regarding a relationship between at least two entities of the database.
    Type: Grant
    Filed: July 13, 2016
    Date of Patent: March 24, 2020
    Assignee: SAP SE
    Inventors: Stefan Baeuerle, Bjoern Mielenhausen, Daniel Hutzel, Ki Hong Kim, Di Wu, Long Zhang
  • Patent number: 10592509
    Abstract: The present disclosure involves systems, software, and computer implemented methods for using declarative rules for optimized access to data. One example method includes receiving a structured query language (SQL) query, the SQL query associated with at least one database table and at least one predicate. A determination is made as to whether the SQL query is associated with at least one declarative rule based on the at least one database table and the at least one predicate. In response to determining that the SQL query is associated with at least one declarative rule, the at least one associated declarative rule is applied, during optimization of the SQL query. The at least one declarative rule defines a transformation to the SQL query to be performed during query optimization. An updated SQL query is generated based on the applied at least one associated declarative rule and the updated SQL query is provided.
    Type: Grant
    Filed: May 22, 2017
    Date of Patent: March 17, 2020
    Assignee: SAP SE
    Inventors: Torsten Ziegler, Christian Hansen, Frank-Martin Haas, Stefan Baeuerle, Mihnea Andrei, Alexander Boehm
  • Patent number: 10558658
    Abstract: A method for propagating a structure query language (SQL) association can include determining, based at least on a syntax of a SQL create view statement, that a SQL association requires propagation to a SQL view associated with the SQL create view statement. The SQL association can combine data from at least a first data model and a second data model at a database. The SQL view can comprise at least a portion of the combined data. An association information data structure can be generated for storing information corresponding to a definition of the SQL association. The SQL create view statement can be executed based on the association information data structure. Related systems and articles of manufacture, including computer program products, are also disclose.
    Type: Grant
    Filed: May 16, 2017
    Date of Patent: February 11, 2020
    Assignee: SAP SE
    Inventors: Di Wu, Ki Hong Kim, Stefan Baeuerle, Steffen Weinstock, Daniel Hutzel, Zhi Qiao
  • Publication number: 20180336245
    Abstract: A method for propagating a structure query language (SQL) association can include determining, based at least on a syntax of a SQL create view statement, that a SQL association requires propagation to a SQL view associated with the SQL create view statement. The SQL association can combine data from at least a first data model and a second data model at a database. The SQL view can comprise at least a portion of the combined data. An association information data structure can be generated for storing information corresponding to a definition of the SQL association. The SQL create view statement can be executed based on the association information data structure. Related systems and articles of manufacture, including computer program products, are also disclose.
    Type: Application
    Filed: May 16, 2017
    Publication date: November 22, 2018
    Inventors: Di Wu, Ki Hong Kim, Stefan Baeuerle, Steffen Weinstock, Daniel Hutzel, Zhi Qiao