13. A computer system comprising the following: one or more processors; system memory; 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 establishing a schema graph that allows queries to be answered by traversing graph nodes, the method comprising the following: an act of accessing a relational database comprising one or more database tables in a first data storage area that stores relational data; an act of extracting a schema graph from the accessed relational database, the schema graph comprising graph nodes representing the accessed database tables, the schema graph further comprising edges, which are displayed as corresponding lines and that visually represent relationships between the graph nodes, wherein at least two edges are represented as separate lines with different display attributes, the different display attributes corresponding to different relationship attributes between different nodes, the schema graph being stored in a second, different storage area; an act of associating one or more relational tables with the graph nodes of the schema graph, such that both the relational tables and the relational tables' corresponding relationships are accessible via the schema graph; an act of receiving a query at the computer system, the query specifying one or more relational tables and their relationships that are to be retrieved from the relational database; and an act of traversing the edges connecting the graph nodes of the schema graph to execute the received query.
19. The computer system of claim 13 , wherein traversing the edges connecting the graph nodes returns a plurality of related incident entities, regardless of the entities' relations.