GRAPH FUNCTIONAL DEPENDENCY CHECKING
    1.
    发明申请

    公开(公告)号:US20200034464A1

    公开(公告)日:2020-01-30

    申请号:US16049055

    申请日:2018-07-30

    Abstract: A computer implemented method for detecting errors in data includes obtaining one or more graph functional dependency (GFD) rules comprising a set of GFD rules, obtaining a set of GFDs representative of the data, building a canonical graph for the GFD rules, and determining that one or more GFD of the set of GFDs conflict based on the set of GFD rules and the canonical graph and, based thereon, determining an error in the set of GFDs.

    Graph functional dependency checking

    公开(公告)号:US11080266B2

    公开(公告)日:2021-08-03

    申请号:US16049055

    申请日:2018-07-30

    Abstract: A computer implemented method for detecting errors in data includes obtaining one or more graph functional dependency (GFD) rules comprising a set of GFD rules, obtaining a set of GFDs representative of the data, building a canonical graph for the GFD rules, and determining that one or more GFD of the set of GFDs conflict based on the set of GFD rules and the canonical graph and, based thereon, determining an error in the set of GFDs.

    Incremental graph computations for querying large graphs

    公开(公告)号:US10885118B2

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

    申请号:US15971524

    申请日:2018-05-04

    Abstract: A mechanism of updating query results for a graph linking data in a computer system is disclosed. Results of the query on the graph linking data are received along with a change to the graph. The change to the graph is determined to be localizable or relatively bounded. Based on the determination of the localizable or relatively bounded change to the graph, the results of the query are updated based on the change to the graph without determining updated results of the query over the graph. This is accomplished by discovering nodes that are affected by the change to the graph, updating data associated with the affected nodes, and applying the updated data to the results of the query.

    MAKING GRAPH PATTERN QUERIES BOUNDED IN BIG GRAPHS

    公开(公告)号:US20170308620A1

    公开(公告)日:2017-10-26

    申请号:US15135046

    申请日:2016-04-21

    CPC classification number: G06F16/9024 G06F16/13 G06F16/24542

    Abstract: A processor executes instructions stored in non-transitory memory storage to receive a pattern query for a graph and determine a set of access constraints corresponding to the pattern query. A determination is made whether the pattern query is effectively bounded under the set of access constraints. A query plan is formed to retrieve a subgraph of the graph when the pattern query is effectively bounded under the set of access constraints. The answer to the pattern query is obtained by accessing the at least one subgraph in response to the query plan.

    Bounded query rewriting using views

    公开(公告)号:US10649994B2

    公开(公告)日:2020-05-12

    申请号:US15966465

    申请日:2018-04-30

    Abstract: A mechanism for rewriting a bounded query onto a view is disclosed. A query, access constraints, and cached view(s) are obtained. The cached view(s) contain results of the query as applied to a dataset stored in a database. A query rewriting plan is generated by adding a fetch from query operation to the plan when a rewritten query variable can be fetched from a query constant. A fetch from database operation is added to the plan when a rewritten query variable can be fetched as a query variable that obtains bounded data from the database. An access view operation is added to the plan when a rewritten query variable can be fetched from the cached view. The query rewriting plan is executed to fetch retrieved data. The query is executed on the retrieved data to determine updated results to the query without reapplying the query to the dataset.

    Incremental Graph Computations for Querying Large Graphs

    公开(公告)号:US20180330008A1

    公开(公告)日:2018-11-15

    申请号:US15971524

    申请日:2018-05-04

    CPC classification number: G06F17/30958 G06F9/4498 G06F17/30979 G06K9/6201

    Abstract: A mechanism of updating query results for a graph linking data in a computer system is disclosed. Results of the query on the graph linking data are received along with a change to the graph. The change to the graph is determined to be localizable or relatively bounded. Based on the determination of the localizable or relatively bounded change to the graph, the results of the query are updated based on the change to the graph without determining updated results of the query over the graph. This is accomplished by discovering nodes that are affected by the change to the graph, updating data associated with the affected nodes, and applying the updated data to the results of the query.

    BOUNDED QUERY REWRITING USING VIEWS
    7.
    发明申请

    公开(公告)号:US20180341677A1

    公开(公告)日:2018-11-29

    申请号:US15966465

    申请日:2018-04-30

    Abstract: A mechanism for rewriting a bounded query onto a view is disclosed. A query, access constraints, and cached view(s) are obtained. The cached view(s) contain results of the query as applied to a dataset stored in a database. A query rewriting plan is generated by adding a fetch from query operation to the plan when a rewritten query variable can be fetched from a query constant. A fetch from database operation is added to the plan when a rewritten query variable can be fetched as a query variable that obtains bounded data from the database. An access view operation is added to the plan when a rewritten query variable can be fetched from the cached view. The query rewriting plan is executed to fetch retrieved data. The query is executed on the retrieved data to determine updated results to the query without reapplying the query to the dataset.

    QUERYING BIG DATA BY ACCESSING SMALL DATA
    8.
    发明申请

    公开(公告)号:US20170277750A1

    公开(公告)日:2017-09-28

    申请号:US15082396

    申请日:2016-03-28

    CPC classification number: G06F16/24542 G06F16/2453 G06F16/24565

    Abstract: A processor executes instructions stored in non-transitory memory to determine whether a query to big data is bounded evaluable, or may be rewritten to access a bounded amount of data or information in a dataset. A query plan may retrieve the information by using indices in access constraints of the query. The cost associated with obtaining the information by using the query plan may be dependent on the query and access constraints and not the size of the dataset. A query plan to obtain the information may be formed for different types or classes of queries, such as conjunctive queries (CQ), unions of conjunctive queries (UCQ) and positive existential FO (first order) conjunctive queries (∃FO+). When a query is not bounded evaluable, a determination is made whether an approximation to the information may be retrieved. An approximation may be obtained by using upper and lower envelopes or specialized queries.

Patent Agency Ranking