Skip to content

Multi-node Graph Containers #866

Answered by gkellogg
zonotope asked this question in Q&A
Discussion options

You must be logged in to vote

That's right out of example 119 in Named Graph Indexing. This makes the algorithm round-trippable.

If you want to coalesce values you can try using the flattening algorithm followed by framing back into the form you're looking for. You can also transform to RDF and back, which will have the same effect.

Replies: 1 comment

Comment options

You must be logged in to vote
0 replies
Answer selected by BigBlueHat
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Category
Q&A
2 participants
Converted from issue

This discussion was converted from issue #845 on May 06, 2025 18:57.