The invention discloses a graph theory-based Oracle database file carving method. The method comprises the following steps of S100, searching a data page block of an Oracle database in an idle area and counting the data page block into a set Addr; S200, sorting the data page blocks in the set Addr according to the ascending order of the data block IDs, and counting the data page blocks into the set NADdr; S300, putting the elements of the set Naddr into a directed acyclic graph, and calculating a relation weight value of each combination; S400, according to the relation weight values, searching a path with the maximum sum of the weight values and non-intersection vertexes in the directed acyclic graph, if the path is found, executing the step S500, and otherwise, ending the process; And S500, verifying the path obtained in the step S400, if the path meets the condition, keeping the path, otherwise, abandoning the current path and executing the step S400.