BOUNDED QUERY REWRITING USING VIEWS
    1.
    发明申请

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

    GRAPH FUNCTIONAL DEPENDENCY CHECKING
    3.
    发明申请

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

    ASYNCHRONOUS CACHE COHERENCY FOR MVCC BASED DATABASE SYSTEMS

    公开(公告)号:US20200034472A1

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

    申请号:US16047458

    申请日:2018-07-27

    Abstract: A database system comprises a persistent storage device, a log node including a memory and a processor, and a plurality of database nodes. A database node includes a cache memory configured to store a database instance, and a processor configured to initiate a database transaction by sending a snapshot request to the log node, the snapshot request including a list of pages that were either replaced or newly loaded in the cache memory. The log node processor is configured to send a snapshot response to the database node, wherein the snapshot response includes a snapshot of the database and a list of changed pages of the database instances. The database node processor is configured to update the status of the pages in cached memory according to the snapshot response and perform the database transaction.

    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.

Patent Agency Ranking