A data storage method, comprising: receiving a data write request that is sent by a first tenant by using a client, wherein the data write request is used to indicate that the first tenant requests to store N duplicates of to-be-written data, and N is an integer greater than or equal to 1; determining, from a plurality of resource zones, RZs, and based on the data write request and storage permission of the first tenant for each of the plurality of RZs, at least one RZ available to the first tenant; determining, based on the data write request and a first data distribution policy, distribution of the N duplicates in the at least one RZ, wherein the first data distribution policy is used to indicate a distribution priority of the N duplicates in the at least one RZ; and storing, based on distribution of the N duplicates in the at least one RZ and a second data distribution policy, the N duplicates into at least one node corresponding to the at least one RZ, wherein the second data distribution policy is used to indicate a distribution priority of the N duplicates at a plurality of nodes corresponding to each of the at least one RZ, wherein the at least one RZ comprises a first RZ and a second RZ, the first RZ is a reserved resource zone RRZ that only the first tenant is allowed to use, and the second RZ is a shared resource zone SRZ that a plurality of tenants comprising the first tenant are allowed to use, characterized in that the first data distribution policy is that the N duplicates are preferentially stored into the first RZ; and the determining, based on the data write request and a first data distribution policy, distribution of the N duplicates in the at least one RZ comprises: determining, based on the data write request, the first data distribution policy, and a space occupation status of the first RZ, that the first RZ is capable of storing P duplicates of the to-be-written data, wherein P is an integer greater than or equal to 1, and the space occupation status is used to indicate a size of occupied space of the first RZ or a size of remaining space of the first RZ; and when N is less than or equal to P, determining that the N duplicates are distributed in the first RZ; or when N is greater than P, determining that the P duplicates in the N duplicates are distributed in the first RZ, and a duplicate, other than the P duplicates, in the N duplicates is distributed in the second RZ. receiving a data write request that is sent by a first tenant by using a client, wherein the data write request is used to indicate that the first tenant requests to store N duplicates of to-be-written data, and N is an integer greater than or equal to 1; determining, from a plurality of resource zones, RZs, and based on the data write request and storage permission of the first tenant for each of the plurality of RZs, at least one RZ available to the first tenant; determining, based on the data write request and a first data distribution policy, distribution of the N duplicates in the at least one RZ, wherein the first data distribution policy is used to indicate a distribution priority of the N duplicates in the at least one RZ; and storing, based on distribution of the N duplicates in the at least one RZ and a second data distribution policy, the N duplicates into at least one node corresponding to the at least one RZ, wherein the second data distribution policy is used to indicate a distribution priority of the N duplicates at a plurality of nodes corresponding to each of the at least one RZ, wherein the at least one RZ comprises a first RZ and a second RZ, the first RZ is a reserved resource zone RRZ that only the first tenant is allowed to use, and the second RZ is a shared resource zone SRZ that a plurality of tenants comprising the first tenant are allowed to use, characterized in that the first data distribution policy is that the N duplicates are preferentially stored into the first RZ; and the determining, based on the data write request and a first data distribution policy, distribution of the N duplicates in the at least one RZ comprises: determining, based on the data write request, the first data distribution policy, and a space occupation status of the first RZ, that the first RZ is capable of storing P duplicates of the to-be-written data, wherein P is an integer greater than or equal to 1, and the space occupation status is used to indicate a size of occupied space of the first RZ or a size of remaining space of the first RZ; and when N is less than or equal to P, determining that the N duplicates are distributed in the first RZ; or when N is greater than P, determining that the P duplicates in the N duplicates are distributed in the first RZ, and a duplicate, other than the P duplicates, in the N duplicates is distributed in the second RZ. determining, based on the data write request, the first data distribution policy, and a space occupation status of the first RZ, that the first RZ is capable of storing P duplicates of the to-be-written data, wherein P is an integer greater than or equal to 1, and the space occupation status is used to indicate a size of occupied space of the first RZ or a size of remaining space of the first RZ; and when N is less than or equal to P, determining that the N duplicates are distributed in the first RZ; or when N is greater than P, determining that the P duplicates in the N duplicates are distributed in the first RZ, and a duplicate, other than the P duplicates, in the N duplicates is distributed in the second RZ.