公开(公告)号：US20180129696A1

公开(公告)日：2018-05-10

申请号：US15344223

申请日：2016-11-04

Applicant: SAP SE

Inventor： Christian Bensberg ,  Steffen Geissinger

IPC: G06F17/30

CPC classification number: G06F16/2365 ,  G06F16/93

Abstract: A system for storage, access, and/or pruning of documents of a document store is provided. In some implementations, the system performs operations comprising analyzing a plurality of parameters of a plurality of documents stored among a plurality of slices in a database and generating, based on the analyzing, statistics about the plurality of parameters including a range of document identifiers present in corresponding slices from the plurality of slices. The operations can further comprise pruning, based on the statistics, one or more slices of the plurality of slices, the pruning triggered in response to a query related to at least a portion of the plurality of stored documents. The operations can further comprise responding to the query based on slices that are not pruned. One or more of the operations can be implemented by a database server. Related systems, methods, and articles of manufacture are also described.

公开(公告)号：US20160378826A1

公开(公告)日：2016-12-29

申请号：US14747767

申请日：2015-06-23

Applicant: SAP SE

Inventor： Christian Bensberg ,  Norman May ,  Sung Heun Wi ,  Sang Il Song ,  Christian Kraus

IPC: G06F17/30

CPC classification number: G06F17/30457 ,  G06F17/3048

Abstract: In a general aspect, a computer-implemented method for executing a query on a table of a database, where the table has multiple partitions, can include receiving a query requesting a view on the table. The view on the table can be based on data included in a partition of the multiple partitions of the table. The method can also include determining a cached result to the query is not available in the database and generating a result to the query from, at least, the data of the partition of the multiple partitions. After the generating, the method can include building a cache including the result to the query, associating a transaction identifier for the query with the result to the query result in the cache; and returning the result to the query.

Abstract translation: 在一般方面，用于在表上具有多个分区的数据库的表上执行查询的计算机实现的方法可以包括接收请求表上的视图的查询。 表上的视图可以基于表中多个分区的分区中包含的数据。 该方法还可以包括确定查询的缓存结果在数据库中不可用，并且至少从多个分区的分区的数据生成查询的结果。 在生成之后，该方法可以包括将包括结果的高速缓存构建到查询，将查询的事务标识符与结果相关联到高速缓存中的查询结果; 并将结果返回到查询。

公开(公告)号：US12216634B1

公开(公告)日：2025-02-04

申请号：US18228187

申请日：2023-07-31

Applicant: SAP SE

Inventor： Christian Bensberg ,  Frederik Transier ,  Kai Stammerjohann

IPC: G06F16/14 ,  G06F3/06 ,  G06F16/22 ,  G06F16/2453

Abstract: 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.

公开(公告)号：US12216582B1

公开(公告)日：2025-02-04

申请号：US18228193

申请日：2023-07-31

Applicant: SAP SE

Inventor： Christian Bensberg ,  Frederik Transier ,  Kai Stammerjohann

IPC: G06F12/08 ,  G06F12/0864 ,  G06F12/0873

Abstract: 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.

公开(公告)号：US12072903B2

公开(公告)日：2024-08-27

申请号：US18103870

申请日：2023-01-31

Applicant: SAP SE

Inventor： Christian Bensberg

IPC: G06F16/00 ,  G06F16/25 ,  G06N5/04

CPC classification number: G06F16/252 ,  G06N5/04

Abstract: 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.

公开(公告)号：US12032578B1

公开(公告)日：2024-07-09

申请号：US18100625

申请日：2023-01-24

Applicant: SAP SE

Inventor： Christian Bensberg ,  Frederik Transier ,  Kai Stammerjohann

IPC: G06F16/2455 ,  G06F16/2457 ,  G06F16/248

CPC classification number: G06F16/24561 ,  G06F16/24573 ,  G06F16/248

Abstract: 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.

公开(公告)号：US11947823B2

公开(公告)日：2024-04-02

申请号：US17750900

申请日：2022-05-23

Applicant: SAP SE

Inventor： Christian Bensberg ,  Steffen Geissinger

IPC: G06F3/06 ,  G06F16/22 ,  G06F16/23 ,  G06F16/2455

CPC classification number: G06F3/0644 ,  G06F3/0604 ,  G06F3/064 ,  G06F3/0673 ,  G06F16/2282 ,  G06F16/2308 ,  G06F16/2379 ,  G06F16/2455

Abstract: A data storage and retrieval system for a computer memory including a memory slice formed of segments and adapted to contain one or more documents and a checkpoint adapted to persist the memory slice. The checkpoint includes a document vector containing a document pointer corresponding to a document. The document pointer including a segment identifier identifying a logical segment of the memory slice and an offset value defining a relative memory location of the first document within the identified segment. There are checkpoint memory blocks, each storing a copy of a corresponding segment of the memory slice. The segment identifier of the document pointer identifies a checkpoint memory block and the offset value of the document pointer defines a relative location of the document within the checkpoint memory block.

公开(公告)号：US11550791B2

公开(公告)日：2023-01-10

申请号：US17207512

申请日：2021-03-19

Applicant: SAP SE

Inventor： Hans-Joerg Leu ,  Christian Bensberg ,  Johannes Beigel ,  Jochen Becker ,  Carsten Mueller

IPC: G06F16/2455 ,  G06F16/27 ,  G06F16/23

Abstract: A node type of a plurality of distributed nodes to which a table to be added to a distributed database should be assigned can be identified by applying a set of placement rules defined for the table. The set of placement rules can also be applied to determine whether the table should be partitioned into more than one partition. A table group name associated with the table can be obtained and used in conjunction with the node type and determination of whether to partition the table to store the table in the distributed database on at least one node of the plurality of nodes as one or more partitions.

公开(公告)号：US11481321B2

公开(公告)日：2022-10-25

申请号：US15469818

申请日：2017-03-27

Applicant: SAP SE

Inventor： Christian Bensberg ,  Steffen Geissinger

IPC: G06F12/02

Abstract: Methods, systems, and computer-readable storage media for determining that a transaction of a plurality of transactions performed in at least a portion of a system includes a delete operation, the plurality of transactions being managed by a secondary transaction manager and including a subset of all transactions performed in the system, in response to the delete operation, inserting a clean-up entry in the secondary transaction manager, attaching the clean-up entry to a subsequent transaction in order to determine and assign a time to the cleanup-entry that is used to subsequently trigger garbage collection, and selectively comparing the time to a most-recently-reported minimum read timestamp that is periodically reported to the secondary transaction manager from a primary transaction manager of the system, wherein the clean-up entry is executed in response to determining that the time is less than the most-recently-reported minimum read timestamp.

公开(公告)号：US20210334257A1

公开(公告)日：2021-10-28

申请号：US16898143

申请日：2020-06-10

Applicant: SAP SE

Inventor： Christian Bensberg ,  Daniel Ritter ,  Neeraj Kulkarni

IPC: G06F16/22 ,  G06F16/93

Abstract: 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.