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