Patents by Inventor Lars Dannecker

Lars Dannecker 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: 11892999
    Abstract: 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: Grant
    Filed: January 19, 2022
    Date of Patent: February 6, 2024
    Assignee: SAP SE
    Inventors: Gordon Gaumnitz, Robert Schulze, Lars Dannecker, Ivan Bowman, Daniel James Farrar
  • Publication number: 20230409730
    Abstract: Systems and methods include creation of a first instance of a tenant object in a database instance, association of the first instance of the tenant object with a first plurality of database artifacts including first data associated with the first instance of the tenant object, creation of a second instance of the tenant object in the database instance, association of the second instance of the tenant object with a second plurality of database artifacts including second data associated with the second instance of the tenant object, and reception and response to queries on the first data associated with the first instance of the tenant object and to queries on the second data associated with the second instance of the tenant object.
    Type: Application
    Filed: August 22, 2022
    Publication date: December 21, 2023
    Inventors: Mihnea ANDREI, Alexander BOEHM, Norman MAY, Urs KLINGSPORN, Meinolf BLOCK, Patrick VOELKER, Hyunjun KIM, Thorsten GLEBE, Jonathan BREGLER, Jaeyoung CHOI, Martin KITTEL, Yong Sik KWON, Uwe HAHN, Henning ZAHN, Melanie HANDRECK, Holger MACK, Eunsang KIM, Frank RENKES, Juchang LEE, Martin SCHINDEWOLF, Ivan BOWMAN, Lars DANNECKER
  • Patent number: 11386104
    Abstract: Disclosed is a system and method for improving database memory consumption and performance using compression of time stamp columns. A number of time stamps of a time series is received. The time stamps have a start time, and are separated by an equal increment of time that defines an interval. The start time and interval are stored in a dictionary of a column store of a database. An index is generated in the column store of the database, the index having a number of index vectors. Using the index vectors, each time stamp of the number of time stamps can be calculated from the start time stored in the dictionary and the position in the time series based on the interval stored in the dictionary.
    Type: Grant
    Filed: October 23, 2019
    Date of Patent: July 12, 2022
    Assignee: SAP SE
    Inventors: Gordon Gaumnitz, Lars Dannecker, Robert Schulze, Ivan T. Bowman, Daniel James Farrar
  • Publication number: 20220138173
    Abstract: 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: Application
    Filed: January 19, 2022
    Publication date: May 5, 2022
    Inventors: Gordon Gaumnitz, Robert Schulze, Lars Dannecker, Ivan Bowman, Daniel James Farrar
  • Patent number: 11263196
    Abstract: 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: Grant
    Filed: March 19, 2019
    Date of Patent: March 1, 2022
    Assignee: SAP SE
    Inventors: Gordon Gaumnitz, Robert Schulze, Lars Dannecker, Ivan T. Bowman, Daniel James Farrar
  • Patent number: 11238023
    Abstract: A system and method include storing a table of time series data in a database of a data platform, the table of time series data representing a set of time series blocks. Each time series block of the set of time series blocks has a time series of equally-incremented time intervals and a run length. Each time interval of the time series is associated with one or more values. The run length has a starting position with at least one starting value and an ending position with at least one ending value. The starting position and the at least one starting value is stored for each time series block in a column store of the database. Then, a compressed index is generated in the column store of the database for each time series block, the compressed index comprising the starting position and the at least one starting value.
    Type: Grant
    Filed: December 16, 2019
    Date of Patent: February 1, 2022
    Assignee: SAP SE
    Inventors: Gordon Gaumnitz, Robert Schulze, Lars Dannecker, Ivan Bowman, Dan Farrar
  • Patent number: 10872075
    Abstract: Time series data may be represented with multiple representations, optionally using a variety of storage approaches, and the plurality of representations may be indexed using a representation index, which includes a start row identifier, a representation identifier, and an offset within the representation for each segment of one or more rows in the time series data column.
    Type: Grant
    Filed: July 20, 2017
    Date of Patent: December 22, 2020
    Assignee: SAP SE
    Inventors: Gordon Gaumnitz, Lars Dannecker
  • Patent number: 10685306
    Abstract: An advisor creates configurations for generating multi-representations of time series data based upon detected characteristics such as length, interval, minimums, data types, etc., as well as configurations provided by a user. In an offline mode the advisor may further consider a previous time series workload. In an on-line mode the advisor may adapt multi-representation configurations with respect to ongoing changes in a current time series workload. The advisor may reference a cost model including values quantifying various dimensions (e.g., compression technique, accuracy, covered time period, storage medium, memory consumption, speed) of the multi-representations for optimization purposes. Configurations created by the advisor may be input to a storage engine to generate and store the multi-representations according to goals for data aging, operation execution pattern optimization, and ease of access to time series data located in hot zones.
    Type: Grant
    Filed: December 7, 2015
    Date of Patent: June 16, 2020
    Assignee: SAP SE
    Inventors: Lars Dannecker, Gordon Gaumnitz, Boyi Ni, Yu Cheng
  • Publication number: 20200117648
    Abstract: A system and method include storing a table of time series data in a database of a data platform, the table of time series data representing a set of time series blocks. Each time series block of the set of time series blocks has a time series of equally-incremented time intervals and a run length. Each time interval of the time series is associated with one or more values. The run length has a starting position with at least one starting value and an ending position with at least one ending value. The starting position and the at least one starting value is stored for each time series block in a column store of the database. Then, a compressed index is generated in the column store of the database for each time series block, the compressed index comprising the starting position and the at least one starting value.
    Type: Application
    Filed: December 16, 2019
    Publication date: April 16, 2020
    Inventors: Gordon Gaumnitz, Robert Schulze, Lars Dannecker, Ivan Bowman, Dan Farrar
  • Publication number: 20200057763
    Abstract: Disclosed is a system and method for improving database memory consumption and performance using compression of time stamp columns. A number of time stamps of a time series is received. The time stamps have a start time, and are separated by an equal increment of time that defines an interval. The start time and interval are stored in a dictionary of a column store of a database. An index is generated in the column store of the database, the index having a number of index vectors. Using the index vectors, each time stamp of the number of time stamps can be calculated from the start time stored in the dictionary and the position in the time series based on the interval stored in the dictionary.
    Type: Application
    Filed: October 23, 2019
    Publication date: February 20, 2020
    Inventors: Gordon Gaumnitz, Lars Dannecker, Robert Schulze, Ivan T. Bowman, Daniel James Farrar
  • Patent number: 10558678
    Abstract: A flexible approach for storing time series data, utilizes multiple representations in order to achieve optimization amongst various dimensions such as covered time period, accuracy, compression model, and storage medium. A first aspect selectively provides different representations for various portions of a time series along the time axis (horizontal). In this horizontal aspect, a first compression model may be applied to store data occurring during one period in a time series, while a different compression model is applied to store data during another period. In a separate (vertical) aspect, time series data over a same time period may be saved in multiple representations using different compression models. While increasing demands on memory, such vertical storage can afford efficient access for specific purposes (i.e., analytical).
    Type: Grant
    Filed: September 6, 2018
    Date of Patent: February 11, 2020
    Assignee: SAP SE
    Inventors: Lars Dannecker, Gordon Gaumnitz, Boyi Ni, Yu Cheng
  • Patent number: 10545936
    Abstract: Linear run length encoding is described. A system and method include storing a table of time series data in a database of a data platform, the table of time series data representing a set of time series blocks. Each time series block of the set of time series blocks has a time series of equally-incremented time intervals and a run length. Each time interval of the time series is associated with one or more values. The run length has a starting position with at least one starting value and an ending position with at least one ending value. The starting position and the at least one starting value is stored for each time series block in a column store of the database. Then, a compressed index is generated in the column store of the database for each time series block, the compressed index comprising the starting position and the at least one starting value.
    Type: Grant
    Filed: July 8, 2014
    Date of Patent: January 28, 2020
    Assignee: SAP SE
    Inventors: Gordon Gaumnitz, Robert Schulze, Lars Dannecker, Ivan Bowman, Dan Farrar
  • Patent number: 10496656
    Abstract: Disclosed is a system and method for improving database memory consumption and performance using compression of time stamp columns. A number of time stamps of a time series is received. The time stamps have a start time, and are separated by an equal increment of time that defines an interval. The start time and interval are stored in a dictionary of a column store of a database. An index is generated in the column store of the database, the index having a number of index vectors. Using the index vectors, each time stamp of the number of time stamps can be calculated from the start time stored in the dictionary and the position in the time series based on the interval stored in the dictionary.
    Type: Grant
    Filed: July 8, 2014
    Date of Patent: December 3, 2019
    Assignee: SAP SE
    Inventors: Gordon Gaumnitz, Robert Schulze, Lars Dannecker, Ivan Bowman, Dan Farrar
  • Patent number: 10445399
    Abstract: A system includes multiple memory modules arranged and configured to store data and at least one processor that is operably coupled to the memory modules. The at least one processor is arranged and configured to select an access pattern of a forecast model, determine a storage layout model based on the identified access pattern of the forecast model, and store values in an order defined by the storage layout model using at least one of the memory modules. The order of the stored values enables sequential access to the stored values for use in the forecast model. Implementations of one or more features of the system may be performed by a computer-implemented method and/or a computer program product.
    Type: Grant
    Filed: May 22, 2014
    Date of Patent: October 15, 2019
    Assignee: SAP SE
    Inventors: Lars Dannecker, Gordon Gaumnitz
  • Publication number: 20190243816
    Abstract: 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: Application
    Filed: March 19, 2019
    Publication date: August 8, 2019
    Inventors: Gordon Gaumnitz, Robert Schulze, Lars Dannecker, Ivan T. Bowman, Daniel James Farrar
  • Patent number: 10248681
    Abstract: 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: Grant
    Filed: July 8, 2014
    Date of Patent: April 2, 2019
    Assignee: SAP SE
    Inventors: Gordon Gaumnitz, Robert Schulze, Lars Dannecker, Ivan Bowman, Dan Farrar
  • Publication number: 20190026329
    Abstract: Time series data may be represented with multiple representations, optionally using a variety of storage approaches, and the plurality of representations may be indexed using a representation index, which includes a start row identifier, a representation identifier, and an offset within the representation for each segment of one or more rows in the time series data column.
    Type: Application
    Filed: July 20, 2017
    Publication date: January 24, 2019
    Inventors: GORDON GAUMNITZ, Lars Dannecker
  • Publication number: 20190005102
    Abstract: A flexible approach for storing time series data, utilizes multiple representations in order to achieve optimization amongst various dimensions such as covered time period, accuracy, compression model, and storage medium. A first aspect selectively provides different representations for various portions of a time series along the time axis (horizontal). In this horizontal aspect, a first compression model may be applied to store data occurring during one period in a time series, while a different compression model is applied to store data during another period. In a separate (vertical) aspect, time series data over a same time period may be saved in multiple representations using different compression models. While increasing demands on memory, such vertical storage can afford efficient access for specific purposes (i.e., analytical).
    Type: Application
    Filed: September 6, 2018
    Publication date: January 3, 2019
    Inventors: Lars Dannecker, Gordon Gaumnitz, Boyi Ni, Yu Cheng
  • Patent number: 10095757
    Abstract: A flexible approach for storing time series data, utilizes multiple representations in order to achieve optimization amongst various dimensions such as covered time period, accuracy, compression model, and storage medium. A first aspect selectively provides different representations for various portions of a time series along the time axis (horizontal). In this horizontal aspect, a first compression model may be applied to store data occurring during one period in a time series, while a different compression model is applied to store data during another period. In a separate (vertical) aspect, time series data over a same time period may be saved in multiple representations using different compression models. While increasing demands on memory, such vertical storage can afford efficient access for specific purposes (i.e., analytical).
    Type: Grant
    Filed: December 7, 2015
    Date of Patent: October 9, 2018
    Assignee: SAP SE
    Inventors: Lars Dannecker, Gordon Gaumnitz, Boyi Ni, Yu Cheng
  • Publication number: 20180239852
    Abstract: Examples of energy forecasting in hierarchical energy systems are provided herein. A global forecast model instance for a hierarchical energy system can be determined through aggregation of energy forecast model data from individual energy smart meters. Energy forecast model data can include values for energy forecast model parameters used by the individual smart meters. The energy smart meters include measurement, forecasting, and calculation capabilities. The smart meters locally determine a forecast model instance used by the smart meter and provide corresponding information to higher levels in the energy system hierarchy. A global forecast model instance is determined based on the provided information.
    Type: Application
    Filed: April 19, 2018
    Publication date: August 23, 2018
    Applicant: SAP SE
    Inventors: Lars Dannecker, Robert Lorenz, Philipp Roesch