Replies: 3 comments
-
I found this comment in the concepts documentation page Relation to Property Graphs section:
Also Issue 47 is a question for which the answer to that issue was
Also I found a rich 2014 mailing list discussion of RDF and scala-graph where @antonkulaga was discussing with @labra functional RDF. |
Beta Was this translation helpful? Give feedback.
-
I finally found the right way to describe RDF graphs which I wrote up in this Toot on mathstodon. Can this be expressed in a scala-graph? I found that the HGraph concept mentioned in the "RDF Surfaces: Computer says No" paper [2] goes back to at least 1990 with the paper "The hypernode model and its associated query language" [1] whose abstract says:
I found this via several routes, but most interestingly is a 2007 technical report "An Abstract Data Model for the Tabulator Data Browser" [3] , where the Tabulator is Tim Berners-Lee's project for a generic RDF User Interface. [1] "The hypernode model" |
Beta Was this translation helpful? Give feedback.
-
Hi, What have you tried so far? In specific, have you checked out https://github.com/scala-graph/scala-graph/blob/2.x/core/src/main/scala/scalax/collection/hyperedges/ordered/HyperEdge.scala which might be a first candidate? |
Beta Was this translation helpful? Give feedback.
-
Hi,
I need to write a new banana-rdf implementation in pure Scala3 at bblfish/banana-rdf. (The most pressing need is for a JS library). The old version called Plantain was built on a straightforward
Map[S, Map[P, Vector[O]]
data structure, which was not that good as it did not allow backwards searches. So I was looking for better ways of doing this. Here is what I found looking aroundInductive Graphs and Functional Graph Algorithms 2001 paper by Marting Erwig
2014 paper Inductive Representations of RDF graphs Jose Emilio Labra Gayo, Johan Jeuring, Jose María Álvarez Rodríguez - which adds the idea that one may need a field to relate to arrows as that is allowed in RDF (see also the 2017 paper Knowledge Representation in Bicategories of Relations which makes that clear)
With a library labra/TGraph that used an older version of
2016 excellent blog post by Runar A Comonad of Graph Decompositions - describing the Quiver library whose latest version getnelson/quiver can be compiled if one takes care to use the correct java and scala versions. But it looks like it was not used that much as there is a non-stack safe function on line 417 of Graph.scala
The graph decomposition idea seems very good but looking at that code it looked like it would be quite slow....
So I finally found your graph library that, looks like it has done all the heavy lifting I needed already...
But I just thought I'd start this conversation in case people have some tips, ideas or can see limitations in the use I need to make of this library.
Beta Was this translation helpful? Give feedback.
All reactions