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.
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. 9. A method according to claim 1 , wherein: applying the function to each hash value includes initiating the aggregate hash value as a constant, incrementally applying the function to each hashed statement to create therefrom a new aggregate hash value, and repeating application of the function until all hashed statements and the constant are represented by the aggregate hash value; and wherein the function is both associative and commutative.