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.
5. A method according to claim 4 , wherein: said method further comprises using the digital processor to compute a hash value for the additional statement to thereby create an incremental hash value, and combining the incremental hash value with the aggregate hash value using a function which is both commutative and associative; and computing a hash value includes applying a SHA-1 hash algorithm to obtain the hash value of each statement.