adsharma commented on issue #679: URL: https://github.com/apache/incubator-graphar/issues/679#issuecomment-3316272353
I've been working on something similar to this. [Blog post](https://adsharma.github.io/beating-the-CAP-theorem-for-graphs/) with details. Since I was not aware of `graph-ar`, I invented [my own](https://github.com/adsharma/graph-std). Proposed syntax: ``` CREATE NODE TABLE Person(ID INT64, name STRING, PRIMARY KEY(ID)) WITH (storage = '/tmp/karate_random'); CREATE REL TABLE knows(FROM Person TO Person, weight DOUBLE) WITH (storage = '/tmp/karate_random'); MATCH (p1:Person)-[r:knows]->(p2:Person) RETURN p1.ID, p2.ID, r.weight; ``` I'm not sure this can be achieved in an extension. So I modified kuzu parser to support this syntax. One of the differences vs the proposal is that I use kuzu table catalog to store metadata instead of yaml files. This is similar to Ducklake vs Iceberg. -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: commits-unsubscr...@graphar.apache.org For queries about this service, please contact Infrastructure at: us...@infra.apache.org --------------------------------------------------------------------- To unsubscribe, e-mail: commits-unsubscr...@graphar.apache.org For additional commands, e-mail: commits-h...@graphar.apache.org
