40. A computer-readable medium that stores instructions for causing at least one processor to convert a database including at least one n-arity relation, where n is greater than 2, into a labeled database pseudograph, by: for each n-arity relation, aggregating a set of attributes which uniquely identify a tuple into a single compound attribute; and generating a respective table in the database for each of the attributes that is not a key such that each table in the database represents a 2-arity or less-arity relation; identifying each element in a set of elements for each of the tables representing a 2-arity or less-arity relation with a respective vertex in the pseudograph; for each 1-arity relation, adding a loop to the respective vertex; and for each 2-arity relation, adding an edge between a respective pair of vertices.
40. A computer-readable medium that stores instructions for causing at least one processor to convert a database including at least one n-arity relation, where n is greater than 2, into a labeled database pseudograph, by: for each n-arity relation, aggregating a set of attributes which uniquely identify a tuple into a single compound attribute; and generating a respective table in the database for each of the attributes that is not a key such that each table in the database represents a 2-arity or less-arity relation; identifying each element in a set of elements for each of the tables representing a 2-arity or less-arity relation with a respective vertex in the pseudograph; for each 1-arity relation, adding a loop to the respective vertex; and for each 2-arity relation, adding an edge between a respective pair of vertices. 41. The computer-readable medium of claim 40 wherein generating a respective table in the database for each of the attributes that is not a key such that each table in the database represents a 2-arity or less-arity relation includes generating a 2-arity table consisting of a compound attribute and an attribute that is not part of the compound attribute.