4. A method according to claim 1 , further comprising adding a new statement to the multiple statements by: identifying a blank node; assigning a label to the identified blank node; and creating the additional statement in a manner that sets forth association of the blank node with the label.
1. A method of processing information representing a graph, comprising: serializing each of multiple statements; using a digital processor to independently compute a hash value for each of the multiple statements; and applying a commutative function to each hash value, to obtain an aggregate hash value representing all of the multiple statements.