Patents by Inventor Robert Schulze
Robert Schulze 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: 20240111757Abstract: A method may include receiving a first transaction inserting a record into a database and a second transaction deleting the record from the database. A validity period for the record may be determined based on a first commit time at which the first transaction is committed and a second commit time at which the second transaction is committed. A current table and/or a history table of a system versioned table may be updated to include the record based on the validity period of the record. One or more temporal operations may be performed based on the system versioned table. For example, a time travel operation may be performed to retrieve, based on the system versioned table, one or more records that are valid at a given point in time. Related systems and computer program products are also provided.Type: ApplicationFiled: December 6, 2023Publication date: April 4, 2024Inventors: Bernhard Scheirle, Andreas Tonder, Carsten Thiel, Guenter Radestock, Thomas Legler, Martin Heidel, Robert Schulze, Joern Schmidt, Rolando Blanco
-
Patent number: 11914589Abstract: In some example embodiments, there may be provided a method including detecting a query operator of a predetermined type requiring a sorting or a scanning responsive to the query operator at a column-oriented database; determining a sorted dictionary at the column-oriented database is eligible for direct access by at least checking that the column-oriented database provides sorted dictionary access and that dictionary collation and a collation of the query operator are the same; when the sorted dictionary is eligible, reading directly from the sorted dictionary a batch of sorted values; and processing, based on the batch sorted values read from the sorted dictionary, the query operator.Type: GrantFiled: February 28, 2020Date of Patent: February 27, 2024Assignee: SAP SEInventors: Oliver Horn, Thomas Legler, Robert Schulze
-
Patent number: 11892999Abstract: A system and method for faster access for compressed time series data. A set of blocks are generated based on a table stored in a database of the data platform. The table stores data associated with multiple sources of data provided as consecutive values, each block containing index vectors having a range of the consecutive values. A block index is generated for each block having a field start vector representing a starting position of the block relative to the range of consecutive values, and a starting value vector representing a value of the block at the starting position. The field start vector of the block index is accessed to obtain the starting position of a field corresponding to a first block and to the range of the consecutive values of the first block. The starting value vector is then determined from the block index to determine an end and a length of the field of the first block.Type: GrantFiled: January 19, 2022Date of Patent: February 6, 2024Assignee: SAP SEInventors: Gordon Gaumnitz, Robert Schulze, Lars Dannecker, Ivan Bowman, Daniel James Farrar
-
Patent number: 11886424Abstract: A method may include receiving a first transaction inserting a record into a database and a second transaction deleting the record from the database. A validity period for the record may be determined based on a first commit time at which the first transaction is committed and a second commit time at which the second transaction is committed. A current table and/or a history table of a system versioned table may be updated to include the record based on the validity period of the record. One or more temporal operations may be performed based on the system versioned table. For example, a time travel operation may be performed to retrieve, based on the system versioned table, one or more records that are valid at a given point in time. Related systems and computer program products are also provided.Type: GrantFiled: September 22, 2021Date of Patent: January 30, 2024Assignee: SAP SEInventors: Bernhard Scheirle, Andreas Tonder, Carsten Thiel, Guenter Radestock, Thomas Legler, Martin Heidel, Robert Schulze, Joern Schmidt, Rolando Blanco
-
Publication number: 20240004855Abstract: According to some embodiments, methods and systems may be associated with a cloud computing environment. A workload prediction framework may receive observed workload information associated with a database in the cloud computing environment (e.g., a DataBase as a Service (“DBaaS”)). Based on the observed workload information, a Statement Arrival Rate (“SAR”) prediction may be generated. In addition, a host variable assignment prediction may be generated based on the observed workload information. The workload prediction framework may then use the SAR prediction and the host variable assignment prediction to automatically create a workload prediction for the database. A physical database design advisor (e.g., a table partitioning advisor) may receive the workload prediction and, responsive to the workload prediction, automatically generate a recommended physical layout for the database (e.g., using a cost model, the current physical layout, and an objective function).Type: ApplicationFiled: September 7, 2023Publication date: January 4, 2024Inventors: Michael BRENDLE, Norman MAY, Robert SCHULZE, Alexander BOEHM, Michael GROSSNIKLAUS, Guido MOERKOTTE
-
Patent number: 11803521Abstract: The present disclosure involves systems, software, and computer implemented methods for improved design and implementation of data access metrics for automated physical database design. An example method includes identifying a database workload for which index advisor access counters are to be tracked. Each SQL statement in the database workload is executed. For each SQL statement, attribute sets are determined for which a selection predicate filters a result for an SQL statement. An output cardinality of each selection predicate is determined. A logarithmic counter for an attribute set corresponding to the selection predicate is determined based on the output cardinality of the selection predicate. The determined logarithmic counter is incremented. Respective values for logarithmic counters of the determined attributes are provided to an index advisor. The index advisor determines attribute sets for which to propose an index based on the logarithmic counters of the respective attribute sets.Type: GrantFiled: May 19, 2021Date of Patent: October 31, 2023Assignee: SAP SEInventors: Michael Brendle, Norman May, Robert Schulze, Alexander Boehm, Guido Moerkotte, Michael Grossniklaus
-
Patent number: 11789920Abstract: According to some embodiments, methods and systems may be associated with a cloud computing environment. A workload prediction framework may receive observed workload information associated with a database in the cloud computing environment (e.g., a DataBase as a Service (“DBaaS”)). Based on the observed workload information, a Statement Arrival Rate (“SAR”) prediction may be generated. In addition, a host variable assignment prediction may be generated based on the observed workload information. The workload prediction framework may then use the SAR prediction and the host variable assignment prediction to automatically create a workload prediction for the database. A physical database design advisor (e.g., a table partitioning advisor) may receive the workload prediction and, responsive to the workload prediction, automatically generate a recommended physical layout for the database (e.g., using a cost model, the current physical layout, and an objective function).Type: GrantFiled: March 28, 2022Date of Patent: October 17, 2023Assignee: SAP SEInventors: Michael Brendle, Norman May, Robert Schulze, Alexander Boehm, Michael Grossniklaus, Guido Moerkotte
-
Patent number: 11789951Abstract: A method, a system, and a computer program product for placement or storage of data structures in memory/storage locations. A type of a data structure for storing data and a type of data access to the data structure are determined. The type of data access includes a first and a second type of data access. A frequency of each type of access to each type of data structure accessed by a query is determined. Using the determined frequency, a number of first type of data accesses to the data structure is compared to a number of second type of accesses to the data structure. The numbers of first and second types of data access are compared to a predetermined threshold percentage of a total number of data accesses to the data structure. Based on the comparisons, a physical memory location for storing data is determined.Type: GrantFiled: September 7, 2021Date of Patent: October 17, 2023Assignee: SAP SEInventors: Robert Lasch, Thomas Legler, Robert Schulze, Kai-Uwe Sattler
-
Patent number: 11775488Abstract: System, method, and various embodiments for providing a data access and recommendation system are described herein. An embodiment operates by identifying a column access of one or more data values of a first column of a plurality of columns of a table of a database during a sampling period. A count of how many of the one or more data values are accessed during the column access are recorded. A first counter is incremented by the count. The sampling period is determined to have expired. A load recommendation on how to load data values into the first column based on the first counter is computed. The load recommendation for implementation into the database for one or more subsequent column accesses is provided.Type: GrantFiled: March 21, 2022Date of Patent: October 3, 2023Assignee: SAP SEInventors: Panfeng Zhou, Vivek Kandiyanallur, Colin Florendo, Robert Schulze, Zheng-Wei She, Yanhong Wang, Amarnadh Sai Eluri
-
Publication number: 20230306009Abstract: According to some embodiments, methods and systems may be associated with a cloud computing environment. A workload prediction framework may receive observed workload information associated with a database in the cloud computing environment (e.g., a DataBase as a Service (“DBaaS”)). Based on the observed workload information, a Statement Arrival Rate (“SAR”) prediction may be generated. In addition, a host variable assignment prediction may be generated based on the observed workload information. The workload prediction framework may then use the SAR prediction and the host variable assignment prediction to automatically create a workload prediction for the database. A physical database design advisor (e.g., a table partitioning advisor) may receive the workload prediction and, responsive to the workload prediction, automatically generate a recommended physical layout for the database (e.g., using a cost model, the current physical layout, and an objective function).Type: ApplicationFiled: March 28, 2022Publication date: September 28, 2023Inventors: Michael BRENDLE, Norman MAY, Robert SCHULZE, Alexander BOEHM, Michael GROSSNIKLAUS, Guido MOERKOTTE
-
Patent number: 11755565Abstract: Disclosed herein are system, method, and computer-program product embodiments for generating a paged and in-memory representation of a database object. An embodiment operates by maintaining in-memory and paged form primitives unique to the database object or a substructure thereof in a database such that the in-memory and paged form primitives are capable of providing the in-memory and paged representations of the database objects, respectively. Thereafter, a load configuration for the database object is determined. Based on the load configuration, the in-memory and/or paged representations of the database object are generated using the in-memory form primitive or the paged form primitive unique to the database object, respectively. Subsequently, the in-memory and/or paged representations of the database object are stored in the database.Type: GrantFiled: October 7, 2021Date of Patent: September 12, 2023Assignee: SAP SEInventors: Colin Florendo, Mihnea Andrei, Amit Pathak, Robert Schulze, Adrian Dragusanu, Reza Sherkat, Sebastian Seifert, Christian Lemke
-
Publication number: 20230086162Abstract: A method may include receiving a first transaction inserting a record into a database and a second transaction deleting the record from the database. A validity period for the record may be determined based on a first commit time at which the first transaction is committed and a second commit time at which the second transaction is committed. A current table and/or a history table of a system versioned table may be updated to include the record based on the validity period of the record. One or more temporal operations may be performed based on the system versioned table. For example, a time travel operation may be performed to retrieve, based on the system versioned table, one or more records that are valid at a given point in time. Related systems and computer program products are also provided.Type: ApplicationFiled: September 22, 2021Publication date: March 23, 2023Inventors: Bernhard Scheirle, Andreas Tonder, Carsten Thiel, Guenter Radestock, Thomas Legler, Martin Heidel, Robert Schulze, Joern Schmidt, Rolando Blanco
-
Publication number: 20230025952Abstract: A database management system is described that can encode data to generate a plurality of data vectors. The database management system can perform the encoding by using a dictionary. The database management system can adaptively reorder the plurality of data vectors to prepare for compression of the plurality of data vectors. During a forward pass of the adaptive reordering, most frequent values of a data vector of the plurality of data vectors can be moved-up in the data vector. During a backward pass of the adaptive reordering, content within a rest range of a plurality of rest ranges can be rearranged within the plurality of data vectors according to frequencies of the content. The reordering according to frequency can further sort the rest range by value. Related apparatuses, systems, methods, techniques, computer programmable products, computer readable media, and articles are also described.Type: ApplicationFiled: September 21, 2022Publication date: January 26, 2023Applicant: SAP SEInventors: Junze BAO, Norman May, Robert Schulze, Christian Lemke, Wei Zhou
-
Patent number: 11550762Abstract: The present disclosure involves systems, software, and computer implemented methods for improved design and implementation of data access metrics for automated physical database design. An example method includes identifying a database workload for which index advisor access counters are to be tracked. Each SQL statement in the database workload is executed. For each SQL statement, attribute sets are determined for which a selection predicate filters a result for an SQL statement. An output cardinality of each selection predicate is determined. A logarithmic counter for an attribute set corresponding to the selection predicate is determined based on the output cardinality of the selection predicate. The determined logarithmic counter is incremented. Respective values for logarithmic counters of the determined attributes are provided to an index advisor. The index advisor determines attribute sets for which to propose an index based on the logarithmic counters of the respective attribute sets.Type: GrantFiled: May 11, 2021Date of Patent: January 10, 2023Assignee: SAP SEInventors: Michael Brendle, Norman May, Robert Schulze, Alexander Boehm, Guido Moerkotte, Michael Grossniklaus
-
Publication number: 20220405288Abstract: A method, a system, and a computer program product for placement or storage of data structures in memory/storage locations. A type of a data structure for storing data and a type of data access to the data structure are determined. The type of data access includes a first and a second type of data access. A frequency of each type of access to each type of data structure accessed by a query is determined. Using the determined frequency, a number of first type of data accesses to the data structure is compared to a number of second type of accesses to the data structure. The numbers of first and second types of data access are compared to a predetermined threshold percentage of a total number of data accesses to the data structure. Based on the comparisons, a physical memory location for storing data is determined.Type: ApplicationFiled: September 7, 2021Publication date: December 22, 2022Inventors: Robert Lasch, Thomas Legler, Robert Schulze, Kai-Uwe Sattler
-
Patent number: 11514028Abstract: System, method, and various embodiments for providing a hybrid data storage and load system are described herein. An embodiment operates by receiving a lookup request comprising a row identifier (ROWID) corresponding to a row of a table of a database. Which of a first set of pages corresponds to a sorted position of the ROWID is identified. The identified page of the first set of pages is loaded from the disk storage to the memory storage. A sorted row position of the ROWID is identified from a memory block of the loaded page from the first set of pages. One of a second set of pages that includes the sorted row position is identified. The identified one of the second set of pages is loaded from the disk storage into memory. The loaded identified one of the second set of pages is searched for the unsorted position of the ROWID.Type: GrantFiled: April 30, 2020Date of Patent: November 29, 2022Assignee: SAP SEInventors: Amit Pathak, Colin Florendo, Pushkar Khadilkar, Robert Schulze
-
Patent number: 11500842Abstract: A database management system is described that can encode data to generate a plurality of data vectors. The database management system can perform the encoding by using a dictionary. The database management system can adaptively reorder the plurality of data vectors to prepare for compression of the plurality of data vectors. During a forward pass of the adaptive reordering, most frequent values of a data vector of the plurality of data vectors can be moved-up in the data vector. During a backward pass of the adaptive reordering, content within a rest range of a plurality of rest ranges can be rearranged within the plurality of data vectors according to frequencies of the content. The reordering according to frequency can further sort the rest range by value. Related apparatuses, systems, methods, techniques, computer programmable products, computer readable media, and articles are also described.Type: GrantFiled: December 14, 2018Date of Patent: November 15, 2022Assignee: SAP SEInventors: Junze Bao, Norman May, Robert Schulze, Christian Lemke, Wei Zhou
-
Patent number: 11487762Abstract: Techniques and solutions are described for partitioning data among different types of computer-readable storage media, such as between RAM and disk-based storage. A measured workload can be used to estimate data access for one or more possible partition arrangements. The partitions arrangements can be automatically enumerated. Scores for the partition arrangements can be calculated, where a score can indicate how efficiently a partition arrangement places frequently accessed data into storage specified for frequently-accessed data and placed infrequently accessed data into storage specified for infrequently accessed data.Type: GrantFiled: July 14, 2020Date of Patent: November 1, 2022Assignee: SAP SEInventors: Norman May, Alexander Boehm, Guido Moerkotte, Michael Brendle, Mahammad Valiyev, Nick Weber, Robert Schulze, Michael Grossniklaus
-
Patent number: 11442862Abstract: Disclosed herein are system, method, and computer program product embodiments for performing fair prefetching. An embodiment operates by splitting a data vector into a first subrange and a second subrange. The embodiment performs a first chance prefetch operation on the first subrange based on a fixed number of pages, thereby loading a set of pages of the first subrange into a main memory. The embodiment performs the first chance prefetch operation on the second subrange based on the fixed number of pages, thereby loading a first set of pages of the second subrange into the main memory. The embodiment performs a second chance prefetch operation on the second subrange based on the performing the first chance prefetch operation on the second subrange, thereby loading a second set of pages of the second subrange into the main memory. The embodiment then executes the query.Type: GrantFiled: April 16, 2020Date of Patent: September 13, 2022Assignee: SAP SEInventors: Robert Schulze, Adrian Dragusanu, Anup Ghatage, Colin Florendo, Mihnea Andrei, Randall Hammon, Sarika Iyer, Simhachala Sasikanth Gottapu, Yanhong Wang
-
Publication number: 20220269653Abstract: The present disclosure involves systems, software, and computer implemented methods for improved design and implementation of data access metrics for automated physical database design. An example method includes identifying a database workload for which index advisor access counters are to be tracked. Each SQL statement in the database workload is executed. For each SQL statement, attribute sets are determined for which a selection predicate filters a result for an SQL statement. An output cardinality of each selection predicate is determined. A logarithmic counter for an attribute set corresponding to the selection predicate is determined based on the output cardinality of the selection predicate. The determined logarithmic counter is incremented. Respective values for logarithmic counters of the determined attributes are provided to an index advisor. The index advisor determines attribute sets for which to propose an index based on the logarithmic counters of the respective attribute sets.Type: ApplicationFiled: May 19, 2021Publication date: August 25, 2022Inventors: Michael Brendle, Norman May, Robert Schulze, Alexander Boehm, Guido Moerkotte, Michael Grossniklaus