1. A computer readable storage medium, comprising executable instructions to: specify a set of database tables defining vertices and database joins defining oriented edges to form a graph, wherein the oriented edges specify directionality characterizing dependent relationships between database tables; identify a query path in the graph; split the graph into a set of directed acyclic graphs, wherein each directed acyclic graph has a single root vertex that does not form a path to itself through oriented edges; remove selected oriented edges from each directed acyclic graph to form a tree corresponding to each directed acyclic graph, wherein the tree is a sub-graph of a directed acyclic graph without loops and one list of joins relates any two database tables in the tree; generate a database query for each tree; apply the database query to database tables to form query results; and display the query results.