THROUGHPUT-OPTIMIZED SCHEMA-FLEXIBLE STORAGE WITH TRANSACTIONAL PROPERTIES

    公开(公告)号:US20230385271A1

    公开(公告)日:2023-11-30

    申请号:US17752066

    申请日:2022-05-24

    Applicant: SAP SE

    CPC classification number: G06F16/2379 G06F16/213 G06F16/278

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

    DISK-BASED MERGE FOR COMBINING MERGED HASH MAPS

    公开(公告)号:US20250134735A1

    公开(公告)日:2025-05-01

    申请号:US18961625

    申请日:2024-11-27

    Applicant: SAP SE

    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.

    BLOOM FILTER FOR AVOIDING PARTITION LOADING

    公开(公告)号:US20250021562A1

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

    申请号:US18221753

    申请日:2023-07-13

    Applicant: SAP SE

    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.

    STORING AND QUERYING KNOWLEDGE GRAPHS IN COLUMN STORES USING A GLOBAL DICTIONARY

    公开(公告)号:US20240320208A1

    公开(公告)日:2024-09-26

    申请号:US18671039

    申请日:2024-05-22

    Applicant: SAP SE

    CPC classification number: G06F16/2282 G06F16/213 G06F16/2255 G06F16/2456

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

    LOCK-FREE READ ACCESS TO HASH MAP DATA STRUCTURES

    公开(公告)号:US20250005012A1

    公开(公告)日:2025-01-02

    申请号:US18757720

    申请日:2024-06-28

    Applicant: SAP SE

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

    LOCK-FREE READ ACCESS TO VECTOR DATA STRUCTURES

    公开(公告)号:US20250004642A1

    公开(公告)日:2025-01-02

    申请号:US18214821

    申请日:2023-06-27

    Applicant: SAP SE

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

    ACCESSING SCHEMA-FLEXIBLE DATA BY APPLYING A FIXED SCHEMA

    公开(公告)号:US20230385249A1

    公开(公告)日:2023-11-30

    申请号:US17752050

    申请日:2022-05-24

    Applicant: SAP SE

    CPC classification number: G06F16/213 G06F16/2282 G06F16/252

    Abstract: Disclosed herein are system, method, and computer program product embodiments for accessing a database collection. In some embodiments, an application generates a database collection. The database collection is configured to store documents (e.g., records). The application generates a database table definition. The database table definition is a proxy or adapter for the database collection. The application receives a request to be executed to be executed on the database collection from a client device. The request specifies the database table definition. The application accesses the database collection, via the database, to process the request using the database table definition.

    DISK-BASED MERGE FOR HASH MAPS
    8.
    发明申请

    公开(公告)号:US20250045267A1

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

    申请号:US18892727

    申请日:2024-09-23

    Applicant: SAP SE

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

    DATA COMPRESSION, STORE, AND SEARCH SYSTEM
    9.
    发明公开

    公开(公告)号:US20240330303A1

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

    申请号:US18739419

    申请日:2024-06-11

    Applicant: SAP SE

    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.

Patent Agency Ranking