# US 2018/0322179 A1 · Processing data between data stores

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2018/0322179 A1
- Document ID: US20180322179A1
- Status: Published application
- Kind: A1
- Application number: 15/773,395
- Filed: 2015-11-04
- Published: 2018-11-08
- Earliest claimed: 2015-11-04
- Assignees: Entit Software LLC
- Applicants: Entit Software LLC
- Inventors: Alexander Kalinin; Alkis Simitsis; Kevin Wilkinson; Mahashweta Das
- Web page: https://patentgrep.com/patent/US20180322179A1

## CPC

- G06F 16/258: {Data format conversion from or to a database}
- G06F 9/544: {Buffers; Shared memory; Pipes}
- G06F 16/248: Presentation of query results
- G06F 16/25: Integrating or interfacing systems involving database management systems
- G06F 16/284: {Relational databases}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## 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.

## Claims

### Claim 1

A non-transitory computer readable medium to store machine readable instructions that when accessed and executed by a processing resource cause a computing device to perform operations, the operations comprising:
establishing a connection between data stores, wherein the data stores comprise a relational database and a graph engine, wherein the connection comprises a shared memory buffer storing data in a data format according to internal structures of the graph engine, and wherein the connection is bi-directional;
enabling data that is stored in the shared memory to be processed by either of the graph engine and the relational database; and
selecting the graph engine or the relational database to process the data based on a query; and
processing the data that is stored in the shared memory by the selected one of the graph engine or the relational database.

### Claim 2 (depends on 1)

The non-transitory computer readable medium of claim 1, wherein the graph engine is embedded within the relational database.

### Claim 3 (depends on 1)

The non-transitory computer readable medium of claim 1, wherein the processing the data that is stored in the shared memory further comprises:
receiving, at the relational database from an application, a query for data;
converting the data from the relational database to a format of the graph engine using the internal data structures of the graph engine;
performing a computation on the data using the graph engine, wherein the computation is based on the query; and
using the relational database or the graph engine to report a result of the query to the application.

### Claim 4 (depends on 3)

The non-transitory computer readable medium of claim 3, further comprising:
determining, whether to process the data with the relational database or the graph engine in response to the query.

### Claim 5 (depends on 1)

The non-transitory computer readable medium of claim 1, the operations further comprising:
transforming relational data from the relational database into a graph engine format of the graph engine according to internal structures of the graph engine,
wherein the transforming further comprises:
ingesting the relational data from the relational database into the shared memory buffer as vertex data and edge data corresponding to the transformed data;
generating location identifiers for each of the vertex data and the edge data; and
accessing the vertex data and the edge data from the shared memory buffer.

### Claim 6 (depends on 5)

The non-transitory computer readable medium of claim 5,
wherein accessing the vertex data and the edge data from the shared memory buffer is performed by the graph engine, and
wherein the graph engine processes the accessed vertex data and edge data.

### Claim 7

A system comprising:
a non-transitory memory to store machine-readable instructions; and
a processing resource to access the memory and execute the machine-readable instructions, the machine-readable instructions comprising:
a connector to establish a connection between a relational data store and a graph engine, wherein the connection comprises a shared memory buffer; and
a convertor system to transform relational data from a relational data format to a graph engine format according to internal data structures of the graph engine and to store the transformed data, including vertex data and edge data, in the shared memory buffer of the connection.

### Claim 8 (depends on 7)

The system of claim 7, wherein the graph engine is embedded within the relational data store to facilitate the exporting the relational data.

### Claim 9 (depends on 7)

The system of claim 7, wherein the graph engine is to perform at least one of graph processing, array processing, signal processing, and video processing.

### Claim 10 (depends on 7)

The system of claim 7, wherein the connector comprises an ingest convertor to ingest the relational data from the relational data store and store the vertex data and the edge data into the shared memory buffer.

### Claim 11 (depends on 7)

The system of claim 7, wherein the connector comprises an export convertor to access the edge data and the vertex data from the shared memory buffer and transform the edge data and the vertex data as corresponding relational data in the relational data format to the relational data store.

### Claim 12 (depends on 11)

The system of claim 11, wherein the graph engine accesses the edge data and the vertex data based on location identifiers provided to the graph engine via an application interface.

### Claim 13 (depends on 7)

The system of claim 7, further comprising an application to provide a query to the relational data store relating to the relational data,
wherein the relational data store comprises a query engine to determine whether to perform processing on the relational data of the relational data store or to pass the query to the graph engine for processing by the graph engine.

### Claim 14 (depends on 13)

The system of claim 13, wherein, in response to the query engine determining to pass the query to the graph engine, the convertor system transforming the relational data into the graph engine format and storing the relational data as the edge data and the vertex data in the shared memory buffer of the connection, the application providing the graph engine with location identifiers for the edge data and the vertex data to enable processing thereof by the graph engine,
wherein a result of the query is reported to the application using the relational data store or the graph engine.

### Claim 15

A method comprising:
receiving, at a relational database from an application, a query for data;
transforming the data from the relational database to a graph engine format according to internal data structures of a graph engine, the transformed data being stored in a shared memory of a connection that employs;
providing location references to the graph engine for accessing the transformed data in the shared memory;
performing a computation on the data in the graph engine format using the graph engine, wherein the computation is based on the query; and
using the relational database or the graph engine to report a result of the query to the application.
