Patents by Inventor Christian Bensberg
Christian Bensberg 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: 12373432Abstract: A method may include receiving a query including at least one unnest operation to unnest a plurality of elements from one or more JavaScript Object Notation (JSON) arrays. The at least one unnest operation may unnest the plurality of elements by generating a table in which each row of the table is populated by one of the plurality of elements. An execution plan may be generated to include a pre-filter operation to filter, prior to the at least one unnest operation, the plurality of elements included in the one or more JSON arrays. For example, the pre-filter operation may be performed by iterating through the elements from the one or more JSON arrays to identify one or more elements satisfying a predicate included in a where clause of the query. The query may be executed in accordance with the execution plan. Related systems and computer program products are also provided.Type: GrantFiled: December 9, 2022Date of Patent: July 29, 2025Assignee: SAP SEInventors: Stefano Belloni, Christian Bensberg, Daniel Ritter
-
Publication number: 20250190492Abstract: The present invention relates to an improved database system architecture designed for generating and managing heterogeneous graphs. The system utilizes a document store in conjunction with a persistent adjacency index to enhance flexibility, adaptability, and transactional visibility during the generation and modification of complex graph structures. Data stored in the document store utilizes a flexible schema for storing data which improves the efficiency in both storing and retrieving data from the document store during graph-related processing tasks.Type: ApplicationFiled: December 6, 2023Publication date: June 12, 2025Inventors: Christian BENSBERG, Stefano BELLONI, Matthias HAUCK, Mathias KEMETER, Umang RAWAT, Roland SEDLER, Alan BRAENZEL, Markus FATH, Gerald FRANZ, Daniel RITTER, Frank TETZEL, Marc JACOB, Hannes JAKSCHITSCH
-
Patent number: 12326845Abstract: A method, a system, and a computer program product for generating a pageable hash index for a document store. A hash map index for data stored on disk using a document array is generated. The hash map index includes a plurality of hash values with each hash value identifying a document stored at a predetermined location in the document array. A transaction for executing using a first document stored in the document array is received. Using the generated hash map index, a location of the first document stored in the document array is identified. At least a portion of a first hash value of the hash map index corresponding to the first document is loaded into a memory location without loading the remaining hashes of the hash map index. Based on the loaded portion of the first hash value, the received transaction is executed.Type: GrantFiled: May 3, 2024Date of Patent: June 10, 2025Assignee: SAP SEInventors: Christian Bensberg, Daniel Ritter, Neeraj Kulkarni
-
Publication number: 20250134735Abstract: Various embodiments for a disk-based merge for combining merged hash maps are described herein. An embodiment operates by identifying a first hash map and a second hash map, and comparing a first hash value from the first hash map with a second hash value from the second hash map, with the lowest index values. A lowest hash value is identified based on the comparison, and an entry corresponding to the lowest hash value is stored in a combined hash map. This process is repeated until all of the hash values from both the first set of hash values and the second set of hash values are stored in the combined hash map. A query is received, and processed based on the combined hash map.Type: ApplicationFiled: November 27, 2024Publication date: May 1, 2025Inventors: Christian BENSBERG, Frederik Transier, Kai Stammerjohann
-
Patent number: 12242727Abstract: Disclosed herein are system, method, and computer program product embodiments for providing a lock-free read access to one or more data structures. An embodiment operates by allocating a first portion of a memory corresponding to a first data structure of the one or more data structures, the first data structure comprising a size. The embodiment then performs a first operation associated with the first data structure. The embodiment then receives a first request to insert second data to the first data structure, and determines whether an increase of the size is to be executed. The embodiment then, based on the determination that an increase of the size is to be executed, inserting the second data to a modified first data structure, comprising: executing garbage collection to free-up the first portion of the memory based on at least one parallel operation associated with the first data structure.Type: GrantFiled: June 27, 2023Date of Patent: March 4, 2025Assignee: SAP SEInventor: Christian Bensberg
-
Publication number: 20250045205Abstract: Various embodiments for a disk-based merge for combining merged hash maps are described herein. An embodiment operates by identifying a first hash map and a second hash map, and comparing a first hash value from the first hash map with a second hash value from the second hash map, with the lowest index values. A lowest hash value is identified based on the comparison, and an entry corresponding to the lowest hash value is stored in a combined hash map. This process is repeated until all of the hash values from both the first set of hash values and the second set of hash values are stored in the combined hash map. A query is received, and processed based on the combined hash map.Type: ApplicationFiled: July 31, 2023Publication date: February 6, 2025Inventors: CHRISTIAN BENSBERG, Frederik Transier, Kai Stammerjohann
-
Publication number: 20250045267Abstract: Various embodiments for a disk-based merge for hash maps are described herein. An embodiment operates by identifying a plurality of hash maps with a plurality of disjunctions. The hash values of each of the entries may be moved to memory and compared for a particular disjunction. A data value with a lower hash value as determined based on the comparison is selected and stored in a merged hash map. The process is repeated until all the data values have been compared. A query is received, and processed based on the merged hash map.Type: ApplicationFiled: September 23, 2024Publication date: February 6, 2025Inventors: Christian BENSBERG, Frederik Transier, Kai Tammerjohann
-
Publication number: 20250045266Abstract: Various embodiments for a disk-based merge for hash maps are described herein. An embodiment operates by identifying a plurality of hash maps with a plurality of disjunctions, ordering the one or more entries in each disjunction based on the hash value, and assigning an index value to each data value based on the ordering. The hash values of each of the entries may be moved to memory and compared for a particular disjunction. A data value with a lower hash value as determined based on the comparison is selected and stored in a merged hash map. The process is repeated until all the data values have been compared. A query is received, and processed based on the merged hash map.Type: ApplicationFiled: July 31, 2023Publication date: February 6, 2025Inventors: CHRISTIAN BENSBERG, Frederik TRANSIER, Kai STAMMERJOHANN
-
Patent number: 12216634Abstract: Various embodiments for a disk-based merge for hash maps are described herein. An embodiment operates by identifying a plurality of hash maps with a plurality of disjunctions, ordering the one or more entries in each disjunction based on the hash value, and assigning an index value to each data value based on the ordering. The hash values of each of the entries may be moved to memory and compared for a particular disjunction. A data value with a lower hash value as determined based on the comparison is selected and stored in a merged hash map. The process is repeated until all the data values have been compared. A query is received, and processed based on the merged hash map.Type: GrantFiled: July 31, 2023Date of Patent: February 4, 2025Assignee: SAP SEInventors: Christian Bensberg, Frederik Transier, Kai Stammerjohann
-
Patent number: 12216582Abstract: Various embodiments for a disk-based merge for combining merged hash maps are described herein. An embodiment operates by identifying a first hash map and a second hash map, and comparing a first hash value from the first hash map with a second hash value from the second hash map, with the lowest index values. A lowest hash value is identified based on the comparison, and an entry corresponding to the lowest hash value is stored in a combined hash map. This process is repeated until all of the hash values from both the first set of hash values and the second set of hash values are stored in the combined hash map. A query is received, and processed based on the combined hash map.Type: GrantFiled: July 31, 2023Date of Patent: February 4, 2025Assignee: SAP SEInventors: Christian Bensberg, Frederik Transier, Kai Stammerjohann
-
Patent number: 12210512Abstract: Disclosed herein are system, method, and computer program product embodiments for transferring data using a failsafe storage system. In some embodiments, a database receives a request to insert records of data. The records of data are to be transmitted from the source system to the target system. The database allocates a partition in the database based on a size of the plurality of records of data. The database inserts one or more records of data in each segment. The database inserts a create timestamp in each record header of the plurality of records. The create timestamp indicates a date and time when an insert of the one or more records of data is committed in a respective segment. The database inserts a delete timestamp in each segment of records of data, as each respective record of data is transmitted to the target system.Type: GrantFiled: May 24, 2022Date of Patent: January 28, 2025Assignee: SAP SEInventors: Christian Bensberg, Christoph Zakwieja
-
Publication number: 20250021539Abstract: Embodiments are described for a database management system comprising a memory and at least one processor coupled to the memory. The at least one processor is configured to receive a plurality of queries and determine a first identifier based on the plurality of queries. The at least one processor is further configured to create a first bloom filter based on the first identifier and receive an additional query corresponding to the first identifier. The at least one processor is further configured to execute the first bloom filter.Type: ApplicationFiled: July 13, 2023Publication date: January 16, 2025Inventors: CHRISTIAN BENSBERG, Kai Stammerjohann, Frederik Transier
-
Publication number: 20250021562Abstract: Embodiments are described for a database management system comprising a memory and at least one processor coupled to the memory. The at least one processor is configured to receive a query that corresponds to a data slice and determine a bloom filter based on the query. The at least one processor is further configured to determine that the data slice includes data requested by the query based on the bloom filter and in response to determining that the data slice includes the data requested by the query, load the data slice to the memory.Type: ApplicationFiled: July 13, 2023Publication date: January 16, 2025Inventors: Christian BENSBERG, Kai STAMMERJOHANN, Frederik TRANSIER
-
Publication number: 20250004642Abstract: Disclosed herein are system, method, and computer program product embodiments for providing a lock-free read access to one or more data structures. An embodiment operates by allocating a first portion of a memory corresponding to a first data structure of the one or more data structures, the first data structure comprising a size. The embodiment then performs a first operation associated with the first data structure. The embodiment then receives a first request to insert second data to the first data structure, and determines whether an increase of the size is to be executed. The embodiment then, based on the determination that an increase of the size is to be executed, inserting the second data to a modified first data structure, comprising: executing garbage collection to free-up the first portion of the memory based on at least one parallel operation associated with the first data structure.Type: ApplicationFiled: June 27, 2023Publication date: January 2, 2025Inventor: Christian BENSBERG
-
Publication number: 20250005012Abstract: Disclosed herein are system, method, and computer program product embodiments for providing a lock-free read access to one or more data structures. An embodiment operates by allocating a first portion of a memory corresponding to a first data structure of the one or more data structures, the first data structure comprising a size. The embodiment then performs a first operation associated with the first data structure. The embodiment then receives a first request to insert second data to the first data structure, and determines whether an increase of the size is to be executed. The embodiment then, based on the determination that an increase of the size is to be executed, inserting the second data to a modified first data structure, comprising: executing garbage collection to free-up the first portion of the memory based on at least one parallel operation associated with the first data structure.Type: ApplicationFiled: June 28, 2024Publication date: January 2, 2025Inventor: Christian BENSBERG
-
Patent number: 12147558Abstract: A database system includes a persistent storage system, a memory storing metadata defining a tenant object and a plurality of database artifacts, a first instance of the tenant object, the first instance associated with a first plurality of the database artifacts including first data associated with the first instance of the tenant object, and a second instance of the tenant object, the second instance associated with a second plurality of the database artifacts including second data associated with the second instance of the tenant object. A processing unit is to execute program code of a database instance to cause the database system to encrypt the first data associated with the first instance of the tenant object using a first public encryption key and store the encrypted first data in the persistent storage system, and encrypt the second data associated with the second instance of the tenant object using a second public encryption key and store the encrypted second data in the persistent storage system.Type: GrantFiled: October 18, 2022Date of Patent: November 19, 2024Assignee: SAP SEInventors: Patrick Voelker, Holger Mack, Meinolf Block, Thorsten Glebe, Mihnea Andrei, Yong Sik Kwon, Dirk Thomsen, Martin Schindewolf, Martin Kittel, Myung Sun Park, Beomsoo Kim, Martin Heidel, Christian Bensberg, Fabian Garagnon, Michael Muehle, Sergej Hardock, Johannes Beigel, Sascha Zorn, Christoph Hohner, Andreas Hartel
-
Publication number: 20240330303Abstract: Various embodiments for a data compression store and search system are described herein. An embodiment operates by receiving a query to search a plurality of documents. It is determined that the plurality of documents are stored in a compressed format comprising a plurality of shells and a plurality of snippets. A first snippet that includes the query identifier is identified, and a first shell including a reference to the first snippet is identified. A readable version of a first document of the plurality of documents is assembled from the first shell. The assembled readable version of the first document is provided responsive to the query.Type: ApplicationFiled: June 11, 2024Publication date: October 3, 2024Inventors: Christian BENSBERG, Frederik TRANSIER, Kai STAMMERJOHANN
-
Publication number: 20240320208Abstract: Various embodiments for a triple integration and querying system with dictionary compression are described herein. An embodiment operates by identifying a table of a database with four or more columns with triple formatted data including one subject column, one predicate column, and two or more object columns. It is determined that a master dictionary is to be generated for the both the subject column and the predicate column based on an identical datatype being used for both columns. A master dictionary including both the unique values from the subject data dictionary and the predicate data dictionary is generated. Values in the subject column and the predicate column are replaced based on the unique values from the master dictionary.Type: ApplicationFiled: May 22, 2024Publication date: September 26, 2024Inventors: Christian BENSBERG, Jonathan DEES, Markus FATH
-
Publication number: 20240289314Abstract: A method, a system, and a computer program product for generating a pageable hash index for a document store. A hash map index for data stored on disk using a document array is generated. The hash map index includes a plurality of hash values with each hash value identifying a document stored at a predetermined location in the document array. A transaction for executing using a first document stored in the document array is received. Using the generated hash map index, a location of the first document stored in the document array is identified. At least a portion of a first hash value of the hash map index corresponding to the first document is loaded into a memory location without loading the remaining hashes of the hash map index. Based on the loaded portion of the first hash value, the received transaction is executed.Type: ApplicationFiled: May 3, 2024Publication date: August 29, 2024Inventors: Christian Bensberg, Daniel Ritter, Neeraj Kulkarni
-
Patent number: 12072903Abstract: Various embodiments for a data management system for managing inferences are described herein. An embodiment operates by identifying a set of core data stored in a named graph and inferences generated based on the core data. A plurality of logged updates to the core data are detected. A query to execute against the named graph is received, and a signal to update the named graph is detected. At least a subset of the inferences are deleted, and the core data is modified based on the plurality of logged updates. A new plurality of inferences are generated based on the updated data. The query is executed against the named graph with the updated data and the new plurality of inferences, and a result from executing the query is returned.Type: GrantFiled: January 31, 2023Date of Patent: August 27, 2024Assignee: SAP SEInventor: Christian Bensberg