Abstract: In this paper,we define the conception of strong functional dependencies and study the partial ordering structure of relation schema with strong functional dependencies.The new theory to find out all candidate keys of relation schema is proposed.The best algorithm for solving all candid- ate keys of relation schema is developed using this theory.