Hello all, sorry french is my native language, first time posting on this list to point towards a research article which i think "validates" the implementation choices in Apache AGE (using JSONB for vertices and edge table), as they are great for "paths of variable length. This type of queries requires recursive SQL queries. Recursive queries with the use of the edge attributes table outperform any recursive query that uses adjacency tables"
The paper also presents another "redundant storage" (adjacency tables, using k "groups" of triples columns + array [] of vertices) which is said to be more efficient (than the edge table) "if the queried path is of fixed length". I tried to summarize the ideas here https://github.com/apache/age/discussions/1348 [https://opengraph.githubassets.com/d0257c95fdd44126be379894c618c9164589217031ece09a492a2455df0c01f1/apache/age/discussions/1348]<https://github.com/apache/age/discussions/1348> Article from Matthias Schmid, University of Passau Germany "An approach to efficiently storing property graphs in relational databases" · apache/age · Discussion #1348<https://github.com/apache/age/discussions/1348> Hello, reposting there because old Discord seems to be outdated and didn't find an appropriate channel on the new one, maybe some of you will find this (main idea is redundant storage to optimize s... github.com Thomas
