公开(公告)号：US20240330303A1

公开(公告)日：2024-10-03

申请号：US18739419

申请日：2024-06-11

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.

公开(公告)号：US20230394039A1

公开(公告)日：2023-12-07

申请号：US17829695

申请日：2022-06-01

Applicant: SAP SE

Inventor： Frederik TRANSIER ,  Kai STAMMERJOHANN

IPC: G06F16/242 ,  G06F16/22

CPC classification number: G06F16/244 ,  G06F16/221 ,  G06F16/2255

Abstract: A system includes reception of a query specifying a database table, an aggregate function, a plurality of grouping columns and an aggregation column, determination of whether a tuple of a first row of the grouping columns in the database tables is unique in the grouping columns, storage, if it is determined that the tuple of the first row of the grouping columns is unique in the grouping columns, of a result set entry including the tuple and an aggregation value determined based on a value of the aggregation column in the first row, and, if it is determined that the tuple of the first row of the grouping columns is not unique in the grouping columns, determination of a key based on the tuple and performance of a hash lookup using the key.

公开(公告)号：US20250045266A1

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

申请号：US18228187

申请日：2023-07-31

Applicant: SAP SE

Inventor： CHRISTIAN BENSBERG ,  Frederik TRANSIER ,  Kai STAMMERJOHANN

IPC: G06F16/22 ,  G06F3/06 ,  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.

公开(公告)号：US20250021562A1

公开(公告)日：2025-01-16

申请号：US18221753

申请日：2023-07-13

Applicant: SAP SE

Inventor： Christian BENSBERG ,  Kai STAMMERJOHANN ,  Frederik TRANSIER

IPC: G06F16/2455

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