Text searches on graph data
    1.
    发明授权

    公开(公告)号:US10769188B2

    公开(公告)日:2020-09-08

    申请号:US15946379

    申请日:2018-04-05

    Applicant: SAP SE

    Abstract: A method for performing text searches on graph data stored in a database is provided. The method may include receiving, from a client, a request to perform a text search to locate a target string in the graph data stored in the database. The request may be in accordance with a declarative graph query configured to query the graph data stored in the database. The response to the request may include performing the text search to locate, in the graph data stored in the database, one or more records of strings that are exact matches, approximate matches, and/or linguistic matches for the target string. Related systems and articles of manufacture, including computer program products, are also provided.

    TEXT SEARCHES ON GRAPH DATA
    2.
    发明申请

    公开(公告)号:US20190311065A1

    公开(公告)日:2019-10-10

    申请号:US15946379

    申请日:2018-04-05

    Applicant: SAP SE

    Abstract: A method for performing text searches on graph data stored in a database is provided. The method may include receiving, from a client, a request to perform a text search to locate a target string in the graph data stored in the database. The request may be in accordance with a declarative graph query configured to query the graph data stored in the database. The response to the request may include performing the text search to locate, in the graph data stored in the database, one or more records of strings that are exact matches, approximate matches, and/or linguistic matches for the target string. Related systems and articles of manufacture, including computer program products, are also provided.

    AD HOC PROCESSING OF GRAPH DATA
    3.
    发明公开

    公开(公告)号:US20230169114A1

    公开(公告)日:2023-06-01

    申请号:US17536923

    申请日:2021-11-29

    Applicant: SAP SE

    CPC classification number: G06F16/9024 G06F16/2433

    Abstract: A method for ad hoc graph data processing may include receiving, from a client device, a graph processing algorithm defined as a part of an anonymous block. The anonymous block may be a data manipulation language (DML) statement containing the graph processing algorithm. The anonymous block may be compiled. The graph progressing algorithm included in the anonymous block may be executed on at least a portion of a graph data stored in a database. The anonymous block being compiled and executed without generating a database object corresponding to the anonymous block at the database. Related systems and computer program products are also provided.

    Storing and querying knowledge graphs in column stores using a global dictionary

    公开(公告)号:US12019608B2

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

    申请号: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