Transforming RDF into (non-binary!) trees

I think we should write some code which would transform RDF into a tree (not necessarily binary! utilize nameless nodes as nodes with N childs) and also check the number of branches of a certain kind (usually 0..1 or 1..1).

Has anyone done a similar job?

I am working for bindings librdf for Ada2012. I could write such code directly in Ada (so it may be easier), but better would be to make C interface for this. I may write in Ada and leave TODO note "port it to C".

Any response?

Victor Porton -

Received on Saturday, 5 July 2014 19:36:18 UTC