公开(公告)号：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.

公开(公告)号：US20250021539A1

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

申请号：US18221757

申请日：2023-07-13

Applicant: SAP SE

Inventor： CHRISTIAN BENSBERG ,  Kai Stammerjohann ,  Frederik Transier

IPC: G06F16/22

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

公开(公告)号：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.