For data storage and node repair in distributed storage systems, heterogeneous fractional repetition (FR) codes are constructed based on mixed orthogonal array. It is proved that the constructed heterogeneous FR codes are universally good generalized fractional repetition (GFR) codes. Concretely, the incidence matrix of FR codes is obtained by using the horizontal pairs in the mixed orthogonal array, and the data blocks are stored in the nodes of distributed storage systems. In addition, the grouping method is used to construct the grouping FR codes on the basis of the mixed orthogonal array, realizing the precise noncoding repair of a single fault node within the local repair group, and the repair locality is 2 or 3. Moreover, the grouping FR codes can repair multiple fault nodes quickly and efficiently. Performance analyses and experimental simulations show that, compared with RS codes and simple regeneration codes, the constructed grouping FR codes have lower repair bandwidth overhead and repair locality, and the repair efficiency is also improved.