Hi Leo, For graph data model, I can think of two popular ways of representations: 1) adjacent matrix: an n x n matrix A (where n is the number of vertices), and Aij = 1 indicates an arc from i to j. 2) adjacent list: a table head node for each vertex, and a list for each vertex to store arcs.
For adjacent matrices, it should be easy to use the existing Arrow library. A matrix is just a vector of vectors. For adjacent lists, it should be straightforward to represent the table head list and edge lists as Arrow vectors. Best, Liya Fan On Wed, Nov 18, 2020 at 12:03 PM Leonidus Bhai <bhai.leoni...@gmail.com> wrote: > Hi, > > I am thinking of building out a Query system using Arrow. I have a graph > data model with objects having bidirectional relationships to each other. > Objects are persisted in an OLTP system with normalized schema. Queries are > scan-like queries across multiple object types having nested relationships. > > Looked at Tensor types but its still unclear how to model relationships > with Arrow types. > > Any thoughts? ideas? Thanks > > Leo >
