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.

    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.

    Balancing CPU Utilization In A Massively Parallel Processing Heterogeneous Cluster

    公开(公告)号:US20180352024A1

    公开(公告)日:2018-12-06

    申请号:US15612747

    申请日:2017-06-02

    Abstract: A system (and associated method) includes a processor which determines a performance metric ratio of a performance metric of a second type of server relative to a performance metric of a first server type for each of multiple sizes of multiple benchmark datasets to thereby determine a plurality of performance metric ratio values. The processor also determines an interpolation function for the plurality of performance metric ratio values usable to compute interpolation performance metric ratios of the second type of server relative to the first type of server for dataset sizes other than the first plurality of sizes. Given a second dataset, the processor determines an amount of the second dataset to provide to each of the respective server types using the interpolation function. The processor configures a load balancer based on the amount of the second dataset determined for each type of server.

    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