Compute the first degree hash: a simple hash based on the immediate "environment" of a blank node, i.e., the quads that the blank node is part of. Ideally, the result uniquely characterizes the blank node (but not always...).
See algorithm details in the spec, and the separate overview.
Compute the first degree hash: a simple hash based on the immediate "environment" of a blank node, i.e., the quads that the blank node is part of. Ideally, the result uniquely characterizes the blank node (but not always...).
See algorithm details in the spec, and the separate overview.