Patents by Inventor Andreas Tonder

Andreas Tonder 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: 11347711
    Abstract: Disclosed herein are system, method, and computer program product embodiments for managing timestamp information in memory systems. In an embodiment, an infrastructure may utilize a controller to manage sparse timestamp blocks. These sparse timestamp blocks may manage timestamp information in a persistent memory structure. Controller 110 may utilize a transient timestamp accessor to map the timestamp information for faster hash lookups. Controller 110 may also utilize a garbage collection map as a bitmap to further save processing steps. Controller 110 may utilize the sparse timestamp blocks, transient timestamp accessor, and garbage collection map to efficiently store timestamp data and to quickly retrieve the stored timestamp data.
    Type: Grant
    Filed: June 5, 2020
    Date of Patent: May 31, 2022
    Assignee: SAP SE
    Inventors: Amarnadh Sai Eluri, Anupam Mukherjee, Andreas Tonder, Vimal Chandran Satheesh
  • Patent number: 10915413
    Abstract: Restoring of a database table in the database system (e.g., an in-memory insert-only database system, etc.) is initiated. Thereafter, a transaction log volume storing data log records and multi-version concurrency control (MVCC) log records corresponding to the database table is accessed. Based on such access, data log records corresponding to the database table are replayed while insert and update MVCC log records corresponding to the database table are skipped. Subsequently, restoring of the database table in the database system is finalized. Related apparatus, systems, techniques and articles are also described.
    Type: Grant
    Filed: January 19, 2017
    Date of Patent: February 9, 2021
    Assignee: SAP SE
    Inventors: Martin Heidel, Andreas Tonder, Shiping Chen
  • Publication number: 20200301906
    Abstract: Disclosed herein are system, method, and computer program product embodiments for managing timestamp information in memory systems. In an embodiment, an infrastructure may utilize a controller to manage sparse timestamp blocks. These sparse timestamp blocks may manage timestamp information in a persistent memory structure. Controller 110 may utilize a transient timestamp accessor to map the timestamp information for faster hash lookups. Controller 110 may also utilize a garbage collection map as a bitmap to further save processing steps. Controller 110 may utilize the sparse timestamp blocks, transient timestamp accessor, and garbage collection map to efficiently store timestamp data and to quickly retrieve the stored timestamp data.
    Type: Application
    Filed: June 5, 2020
    Publication date: September 24, 2020
    Inventors: Amarnadh Sai Eluri, Anupam Mukherjee, Andreas Tonder, Vimal Chandran Satheesh
  • Patent number: 10762068
    Abstract: A system for implementing virtual columns in a column store database is provided. In some implementations, the system performs operations including accessing a database table in a column store database system, the database table comprising at least one virtual column, the column store database system storing data in a column-oriented structure. The operations further include calculating a value for the at least one virtual column based on at least one existing column of the database table, the calculated value mapped to a row identifier associated with a row of the database table. The operations further include providing, in response to a query, the calculated value to a user interface, the query associated with the row identifier.
    Type: Grant
    Filed: April 4, 2018
    Date of Patent: September 1, 2020
    Assignee: SAP SE
    Inventors: Thomas Legler, Andreas Tonder
  • Patent number: 10706019
    Abstract: Disclosed herein are system, method, and computer program product embodiments for performing database processing after a lock condition. An embodiment operates by receiving a release of a lock on data of a database. It is determined whether the data was modified by a processing of a first transaction associated with the first request. The lock is provided to a second transaction associated with a second request to access the data. If the first transaction did not modify the data, a second transaction associated with the second request is retried without refreshing a snapshot of the data. If the first transaction modified the data, the snapshot of the data is refreshed before the second transaction is retried.
    Type: Grant
    Filed: September 22, 2015
    Date of Patent: July 7, 2020
    Assignee: SAP SE
    Inventors: Andreas Tonder, Martin Heidel, Edward-Robert Tyercha, Juchang Lee
  • Patent number: 10678772
    Abstract: Disclosed herein are system, method, and computer program product embodiments for managing timestamp information in memory systems. In an embodiment, an infrastructure may utilize a controller to manage sparse timestamp blocks. These sparse timestamp blocks may manage timestamp information in a persistent memory structure. Controller 110 may utilize a transient timestamp accessor to map the timestamp information for faster hash lookups. Controller 110 may also utilize a garbage collection map as a bitmap to further save processing steps. Controller 110 may utilize the sparse timestamp blocks, transient timestamp accessor, and garbage collection map to efficiently store timestamp data and to quickly retrieve the stored timestamp data.
    Type: Grant
    Filed: May 16, 2018
    Date of Patent: June 9, 2020
    Assignee: SAP SE
    Inventors: Amarnadh Sai Eluri, Anupam Mukherjee, Andreas Tonder, Vimal Chandran Satheesh
  • Patent number: 10552402
    Abstract: An operation on a row of a table of a database is initiated. Thereafter, a multi-version concurrency control (MVCC) object is accessed to identify blocks associated with the row position of the row using bitwise operations. Subsequently, a row state block computed based on the row position of the row is accessed to determine a row state for the row. At least one other block is accessed, based in part on the row state, to obtain at least one timestamp from the computed offset based on the row. Next, the at least one timestamp is stored or retrieved. Related apparatus, systems, techniques and articles are also described.
    Type: Grant
    Filed: November 25, 2014
    Date of Patent: February 4, 2020
    Inventors: Amarnadh Sai Eluri, Ivan Schreter, Andreas Tonder
  • Patent number: 10515059
    Abstract: Calculation of aggregated values in a history database table can be optimized using an approach in which an ordered history table is accessed. The ordered history table can include a sequential listing of commit identifiers associated with updates, insertions, and/or deletions to values in the database table. The ordered history table can be traversed in a single pass to calculate an aggregation function using an optimized algorithm. The optimized algorithm can enable calculation of an aggregated metric of the values based on a selected method for tracking invalidated values to their corresponding commit identifiers. The calculated metric is generated for a current version of the database table; and promoted.
    Type: Grant
    Filed: July 31, 2017
    Date of Patent: December 24, 2019
    Assignee: SAP SE
    Inventors: Martin Kaufmann, Norman May, Andreas Tonder, Donald Kossmann
  • Publication number: 20190354620
    Abstract: Disclosed herein are system, method, and computer program product embodiments for managing timestamp information in memory systems. In an embodiment, an infrastructure may utilize a controller to manage sparse timestamp blocks. These sparse timestamp blocks may manage timestamp information in a persistent memory structure. Controller 110 may utilize a transient timestamp accessor to map the timestamp information for faster hash lookups. Controller 110 may also utilize a garbage collection map as a bitmap to further save processing steps. Controller 110 may utilize the sparse timestamp blocks, transient timestamp accessor, and garbage collection map to efficiently store timestamp data and to quickly retrieve the stored timestamp data.
    Type: Application
    Filed: May 16, 2018
    Publication date: November 21, 2019
    Inventors: Amarnadh Sai Eluri, Anupam Mukherjee, Andreas Tonder, Vimal Chandran Satheesh
  • Patent number: 10474697
    Abstract: An update to a partitioning column for a partitioned table in a database can be performed by handling rows for which the update will not require moving to a different partition separately (e.g. “locally”) for each partition followed by re-inserting those rows that will require moving to a different partition and deleting them from the original partition. The re-inserted rows are directed to a correct partition by application of the partitioning criteria for the table. Methods, articles, and systems are described.
    Type: Grant
    Filed: December 17, 2015
    Date of Patent: November 12, 2019
    Assignee: SAP SE
    Inventors: Christian Bensberg, Lars Fricke, Martin Heidel, Holger Bischoff, Joern Schmidt, Edward-Robert Tyercha, Andreas Tonder
  • Publication number: 20190311051
    Abstract: A system for implementing virtual columns in a column store database is provided. In some implementations, the system performs operations including accessing a database table in a column store database system, the database table comprising at least one virtual column, the column store database system storing data in a column-oriented structure. The operations further include calculating a value for the at least one virtual column based on at least one existing column of the database table, the calculated value mapped to a row identifier associated with a row of the database table. The operations further include providing, in response to a query, the calculated value to a user interface, the query associated with the row identifier.
    Type: Application
    Filed: April 4, 2018
    Publication date: October 10, 2019
    Inventors: Thomas Legler, Andreas Tonder
  • Patent number: 10055440
    Abstract: Partitioning of a source table of a database to a target table is initiated. Thereafter, a replay table is generated that is populated with triggers for database operations performed on the source table for subsequent replay for the target partitions. Data is later moved (e.g., asynchronously moved, etc.) from the source table to the target table. The database operations are replayed on the target table T subsequent to the moving of the data using the replay table. In addition, the source table is dropped when all of the data has been moved to the target table and there are no operations requiring replay. Related apparatus, systems, techniques and articles are also described.
    Type: Grant
    Filed: February 24, 2014
    Date of Patent: August 21, 2018
    Assignee: SAP SE
    Inventors: Christian Bensberg, Franz Faerber, Lars Fricke, Juchang Lee, Roland Sedler, Andreas Tonder, Emanuel Ziegler
  • Publication number: 20180203771
    Abstract: Restoring of a database table in the database system (e.g., an in-memory insert-only database system, etc.) is initiated. Thereafter, a transaction log volume storing data log records and multi-version concurrency control (MVCC) log records corresponding to the database table is accessed. Based on such access, data log records corresponding to the database table are replayed while insert and update MVCC log records corresponding to the database table are skipped. Subsequently, restoring of the database table in the database system is finalized. Related apparatus, systems, techniques and articles are also described.
    Type: Application
    Filed: January 19, 2017
    Publication date: July 19, 2018
    Inventors: Martin Heidel, Andreas Tonder, Shiping Chen
  • Publication number: 20170329807
    Abstract: Calculation of aggregated values in a history database table can be optimized using an approach in which an ordered history table is accessed. The ordered history table can include a sequential listing of commit identifiers associated with updates, insertions, and/or deletions to values in the database table. The ordered history table can be traversed in a single pass to calculate an aggregation function using an optimized algorithm. The optimized algorithm can enable calculation of an aggregated metric of the values based on a selected method for tracking invalidated values to their corresponding commit identifiers. The calculated metric is generated for a current version of the database table; and promoted.
    Type: Application
    Filed: July 31, 2017
    Publication date: November 16, 2017
    Inventors: Martin Kaufmann, Norman May, Andreas Tonder, Donald Kossmann
  • Patent number: 9720942
    Abstract: Calculation of aggregated values in a history database table can be optimized using an approach in which an ordered history table is accessed. The ordered history table can include a sequential listing of commit identifiers associated with updates, insertions, and/or deletions to values in the database table. The ordered history table can be traversed in a single pass to calculate an aggregation function using an optimized algorithm. The optimized algorithm can enable calculation of an aggregated metric of the values based on a selected method for tracking invalidated values to their corresponding commit identifiers. The calculated metric is generated for a current version of the database table; and promoted.
    Type: Grant
    Filed: April 29, 2014
    Date of Patent: August 1, 2017
    Assignee: SAP SE
    Inventors: Martin Kaufmann, Norman May, Andreas Tonder, Donald Kossmann
  • Publication number: 20170177700
    Abstract: An update to a partitioning column for a partitioned table in a database can be performed by handling rows for which the update will not require moving to a different partition separately (e.g. “locally”) for each partition followed by re-inserting those rows that will require moving to a different partition and deleting them from the original partition. The re-inserted rows are directed to a correct partition by application of the partitioning criteria for the table. Methods, articles, and systems are described.
    Type: Application
    Filed: December 17, 2015
    Publication date: June 22, 2017
    Applicant: SAP SE
    Inventors: Christian Bensberg, Lars Fricke, Martin Heidel, Holger Bischoff, Joern Schmidt, Edward-Robert Tyercha, Andreas Tonder
  • Publication number: 20170083538
    Abstract: Disclosed herein are system, method, and computer program product embodiments for performing database processing after a lock condition. An embodiment operates by receiving a release of a lock on data of a database. It is determined whether the data was modified by a processing of a first transaction associated with the first request. The lock is provided to a second transaction associated with a second request to access the data. If the first transaction did not modify the data, a second transaction associated with the second request is retried without refreshing a snapshot of the data. If the first transaction modified the data, the snapshot of the data is refreshed before the second transaction is retried.
    Type: Application
    Filed: September 22, 2015
    Publication date: March 23, 2017
    Inventors: Andreas Tonder, Martin Heidel, Edward-Robert Tyercha, Juchang Lee
  • Publication number: 20160147811
    Abstract: An operation on a row of a table of a database is initiated. Thereafter, a multi-version concurrency control (MVCC) object is accessed to identify blocks associated with the row position of the row using bitwise operations. Subsequently, a row state block computed based on the row position of the row is accessed to determine a row state for the row. At least one other block is accessed, based in part on the row state, to obtain at least one timestamp from the computed offset based on the row. Next, the at least one timestamp is stored or retrieved. Related apparatus, systems, techniques and articles are also described.
    Type: Application
    Filed: November 25, 2014
    Publication date: May 26, 2016
    Inventors: Amarnadh Sai Eluri, Ivan Schreter, Andreas Tonder
  • Publication number: 20150242400
    Abstract: Partitioning of a source table of a database to a target table is initiated. Thereafter, a replay table is generated that is populated with triggers for database operations performed on the source table for subsequent replay for the target partitions. Data is later moved (e.g., asynchronously moved, etc.) from the source table to the target table. The database operations are replayed on the target table T subsequent to the moving of the data using the replay table. In addition, the source table is dropped when all of the data has been moved to the target table and there are no operations requiring replay. Related apparatus, systems, techniques and articles are also described.
    Type: Application
    Filed: February 24, 2014
    Publication date: August 27, 2015
    Inventors: Christian Bensberg, Franz Faerber, Lars Fricke, Juchang Lee, Roland Sedler, Andreas Tonder, Emanuel Ziegler
  • Publication number: 20150006466
    Abstract: Online transactional processing (OLTP) transactions and online analytic processing (OLAP) transactions (e.g., aggregation operations, etc.) are both initiated on at least one table within a columnar oriented insert-only database in which at least a portion of the transactions are executed concurrently. Subsequently, it is checked, for each transaction, whether a corresponding record number is visible for the OLTP transaction using a create baselist bitvector and a delete baselist bitvector for the corresponding table. Thereafter, the OLTP transactions and the OLAP transactions having visible corresponding record numbers are executed. Related apparatus, systems, techniques and articles are also described.
    Type: Application
    Filed: September 3, 2013
    Publication date: January 1, 2015
    Inventors: Andreas Tonder, Wolfgang Stephan, Ivan Schreter