Graph database query classification based on previous queries stored in repository

    公开(公告)号:US10956504B2

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

    申请号:US15760378

    申请日:2015-09-23

    Abstract: Examples for graph database query classification include receiving a graph query and determining if the graph query matches benchmark data. In the event that the graph query does not match benchmark data, the query may be parsed, a canonical internal representation of the query may be determined, the representation may be mapped to a rule, and the query may be classified based on the rule. In the event that the confidence score for the query classification does not exceed a threshold, the query may be sent to a synthetic graph or synopsis for simulation. In some examples, the simulation may include selecting computationally expensive graph operators in the query for simulation.

    Processing data between data stores

    公开(公告)号:US11487780B2

    公开(公告)日:2022-11-01

    申请号:US15773395

    申请日:2015-11-04

    Abstract: A non-transitory computer readable medium can store machine readable instructions that when accessed and executed by a processing resource cause a computing device to perform operations. The operations can include establishing a connection between data stores (such as a relational data store and a graph engine), wherein the connection includes a shared memory buffer storing data in a data format according to internal structures of the graph engine. The connection between the data stores is bi-directional. The connection enables data that is stored in the shared memory to be processed by either of the graph engine and the relational database. Upon receiving a query, the graph engine or the relational database can be selected to process the data based on a query. The data can be processed by the selected one of the graph engine or the relational database.

    PROCESSING DATA BETWEEN DATA STORES
    3.
    发明申请

    公开(公告)号:US20180322179A1

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

    申请号:US15773395

    申请日:2015-11-04

    Abstract: A non-transitory computer readable medium can store machine readable instructions that when accessed and executed by a processing resource cause a computing device to perform operations. The operations can include establishing a connection between data stores (such as a relational data store and a graph engine), wherein the connection includes a shared memory buffer storing data in a data format according to internal structures of the graph engine. The connection between the data stores is bi-directional. The connection enables data that is stored in the shared memory to be processed by either of the graph engine and the relational database. Upon receiving a query, the graph engine or the relational database can be selected to process the data based on a query. The data can be processed by the selected one of the graph engine or the relational database.

Patent Agency Ranking