Binary information table, multi-valued information table and set-valued information table are three kinds of information systems often encountered in information processing. For any information system, we can often induce different information granular structures, and then construct the corresponding rough set models. Generally speaking, for the same information system, three models of Pawlak rough set, covering rough set and multi-granulation rough set can be induced according to different rules. These three kinds of rough set models are effective tools for data mining and information processing. This paper studies the relationship among Pawlak rough set, covering rough set and multi granularity rough set induced in binary information table, multi-valued information table and set-valued information table, and obtains many important conclusions. The research content of this paper effectively connects the theories, methods and applications of Pawlak rough set, covering rough set and multi granularity rough set, which not only enriches the rough set theory, but also expands the application prospect of rough set.