8. The computer system of claim 1 , wherein the plurality of graph nodes represent at least two different types of relational tables.
1. A computer system comprising the following: one or more processors; one or more computer-readable storage media having stored thereon computer-executable instructions that, when executed by the one or more processors, cause the computing system to execute a method for processing a query using schema graph traversal, the method comprising the following: an act of receiving a query at the computer system from a query sender, the query specifying one or more relational tables and their relationships that are to be retrieved from a relational database; an act of creating a schema graph comprising one or more graph nodes representing relational tables and one or more edges that identify relationships between the relational tables, the graph nodes including relational data that was loaded from a first storage area, the schema graph itself being stored in a second storage area, wherein the creating the schema graph includes at least the following: accessing a plurality of relational tables; generating a plurality of graph nodes, with a separate graph node for each of the plurality of relational tables represented by the schema graph; generating a plurality of edges between different graph nodes that define the relationships between the relational tables, at least a first edge of the plurality of edges and a second edge of the plurality of edges define different relationship attributes, such that nodes connected by the first edge have at least one of a different type or a different quantity of relationships than different nodes that are connected by the second edge; and visually representing the schema graph with the plurality of nodes and the plurality of edges, wherein the first and second edges are represented as separate lines with different display attributes, the different display attributes corresponding to different relationship attributes between different nodes; an act of traversing the schema graph, beginning at a set of graph nodes and continuing along the edges to one or more other graph nodes until the query has been satisfied; and an act of reporting the results of the graph traversal.