I have 2 questions:
In the same repository, can a graph node be shared across different named graphs?
Is looking up for a named graph an O(1) operation during a GET operation ? Or is there a performance advantage of using named graphs ?
O(1)
as the required list of statements is directly accessible. In a native store (Sesame's persistent on-disk store) the complexity depends on which indices are available, but on average it's O(log n)
.