Closed greenTara closed 8 years ago
One way around this would be to define merge and union as relations rather than functions (i.e. operations). However, with a proper definition merge and union can be viewed as operations on equivalence classes of isomorphic streams. This is actually not that different from the merge and union of RDF graphs, because there is nondeterminism in the renaming of bnodes during merge.
The definition is complicated by the current definition of RDF stream such that it is a sequence, while in general the merge or union of streams is not a deterministic sequence, but is an equivalence class of isomorphic streams.