Micro Focus Lcc

Hewlett-packard Development Company, L.p.

Alkis Simitsis

Mahashweta Das

William Kevin Wilkinson

Georgia Koutrika

Alexander Kalinin

Kevin Wilkinson

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

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.

Graph database query classification based on previous queries stored in repository

Examples relate to citation explanations. A process to provide citation explanation is provided herein. The process analyzes a primary document to extract a citation claim. The process generates a set of candidate segments of a cited document that may correspond to the citation claim. The process also analyzes the set of candidate segments.

Growing community of inventors

Palo Alto, CA, United States of America

Alkis Simitsis