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

    公开(公告)号:US20250045266A1

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

    申请号:US18228187

    申请日:2023-07-31

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

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

    公开(公告)号:US20240248899A1

    公开(公告)日:2024-07-25

    申请号:US18100625

    申请日:2023-01-24

    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.

    DISK-BASED MERGE FOR COMBINING MERGED HASH MAPS

    公开(公告)号:US20250045205A1

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

    申请号:US18228193

    申请日:2023-07-31

    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.

    USED IDENTIFIER CACHE
    4.
    发明申请

    公开(公告)号:US20250021539A1

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

    申请号:US18221757

    申请日: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 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.

    DATA MANAGEMENT SYSTEM FOR MANAGING INFERENCES

    公开(公告)号:US20240256560A1

    公开(公告)日:2024-08-01

    申请号:US18103870

    申请日:2023-01-31

    Applicant: SAP SE

    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.

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

    公开(公告)号:US20240070136A1

    公开(公告)日:2024-02-29

    申请号:US17893608

    申请日:2022-08-23

    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 subject data dictionary and a predicate data dictionary are generated. A unique value is assigned a same unique identifier a in both the object data dictionary and the subject data dictionary. 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.

Patent Agency Ranking