Abstract: An apparatus comprises a processing device configured to maintain a deduplication data structure comprising sub-portions associated with different compression ratio ranges and having different numbers of data block identifiers. The processing device is also configured to identify a given data block identifier and a given compression ratio for a given data block to be stored, and to determine whether the given data block identifier is in a given one of the sub-portions having a given compression ratio range including the given compression ratio. The processing device is further configured, responsive to determining that the given data block identifier is not in the given sub-portion, to write the given data block to a physical space block of the storage system and, responsive to determining that the given data block identifier is in the given sub-portion, to increment a deduplication reference count for the given data block identifier.

Abstract: An apparatus comprises a processing device configured to maintain a deduplication data structure comprising sub-portions associated with different compression ratio ranges and having different numbers of data block identifiers. The processing device is also configured to identify a given data block identifier and a given compression ratio for a given data block to be stored, and to determine whether the given data block identifier is in a given one of the sub-portions having a given compression ratio range including the given compression ratio. The processing device is further configured, responsive to determining that the given data block identifier is not in the given sub-portion, to write the given data block to a physical space block of the storage system and, responsive to determining that the given data block identifier is in the given sub-portion, to increment a deduplication reference count for the given data block identifier.

Abstract: Techniques for cache management involve: determining respective elimination scores of a plurality of entries in a cache based at least in part on compression rates of data blocks corresponding to the plurality of entries, the elimination score being proportional to the compression rate; and removing, from the cache, at least one entry with a relatively low elimination score among the plurality of entries. Such techniques are able to optimize the retention and elimination strategies for entries in a cache, thus increasing payoffs for using the cache.

Abstract: Adaptive matching is provided, which is used to automatically match a block size of a transactional file system with an IO size of a client. An example method includes creating a share domain, wherein the share domain is created on a first file system, and a block size of the first file system is a first block size. The method further includes determining a block size of the share domain as a second block size, wherein the second block size is not equal to the first block size. If a block size of a second file system is the second block size, the share domain is migrated from the first file system to the second file system. By implementing the present application, it is possible to simplify user operations, improve operational convenience, and help to reduce storage space fragments and indirect blocks, thereby further improving the performance of a storage system.

Abstract: Embodiments of the present disclosure relate to a data backup method, a data backup device, and a computer program product. The method includes: determining delta data based on previous data and current data of a storage system; determining a delta data block subset in a delta data block set; sending delta index information and delta reference information associated with delta data blocks in the delta data block subset to a backup storage system; and sending, to the backup storage system, a further delta data block subset including delta data blocks in the delta data block set other than the delta data block subset. With the technical solution of the present disclosure, the amount of data transmission, the amount of computation, and the usage of a processing unit and a memory when backing up data can be reduced.

Abstract: Embodiments of the present disclosure relate to a method, an electronic device, and a computer program product for presenting I/O write records. The method includes: obtaining I/O write records for a file system within a time period; dividing the time period into a plurality of consecutive sub-time-periods based on a predetermined time interval; determining a plurality of I/O write numbers associated with the plurality of sub-time-periods based on the I/O write records; and graphically presenting the plurality of I/O write numbers in chronological order. Using the technical solution of the present disclosure, changes in the I/O write numbers over time can be presented to a user in a chronological, intuitive, and easily recognizable manner, so that the user can easily find a changing law of the I/O write numbers over time, and can further select data protection forms and schedules to be adopted, thereby improving user experience of the user with needs for data analysis and data protection.

Abstract: Techniques for accessing a file involve determining whether a client requests a permission for a target file, the permission allowing the client to cache data associated with the target file. The techniques further involve in response to determining that the client requests the permission, obtaining pattern information related to an access pattern in which the client accesses the target file. The techniques further involve determining availability of the permission to the client by applying the pattern information to a decision model, the decision model being trained based on training pattern information and training permission information. The techniques further involve providing, to the client, an indication on the availability. Accordingly, access conflicts can be reduced, so that the performance of the client and server can be improved.

Abstract: Techniques for cache management involve: determining respective elimination scores of a plurality of entries in a cache based at least in part on compression rates of data blocks corresponding to the plurality of entries, the elimination score being proportional to the compression rate; and removing, from the cache, at least one entry with a relatively low elimination score among the plurality of entries. Such techniques are able to optimize the retention and elimination strategies for entries in a cache, thus increasing payoffs for using the cache.

Abstract: Techniques involve: determining, based on sizes of a storage space used by a file system at a set of historical moments and a current moment, predicted sizes of a storage space to be used by the file system at a plurality of future moments. The techniques further involve: determining sizes of an available storage space and available durations of a set of candidate future moments in the plurality of future moments based on the predicted sizes. The techniques further involve: determining, based on the sizes of the available storage space and the available durations of the set of candidate future moments, predicted values that characterize available storage capacities of the set of candidate future moments. The techniques further involve: determining a target moment from the set of candidate future moments based on the predicted values to recycle at least part of an available storage space of the target moment.

Abstract: Techniques process an access management permission. Such techniques involve: receiving, from a client, a first request for obtaining an access management permission of a file. The techniques further involve: obtaining a current score of the file, wherein the current score indicates a probability of receiving, after the access management permission is assigned to the client, a second request conflicting with the first request. The techniques further involve: assigning the access management permission to the client if it is determined that the current score is greater than or equal to a threshold score. Such techniques alleviate the need to assign, to a client, the access management permission of a file with a high probability of an access conflict, thus enhancing the performance of the server as well as the user experience.

Abstract: Embodiments of the present disclosure relate to a method, an electronic device, and a computer program product for presenting I/O write records. The method includes: obtaining I/O write records for a file system within a time period; dividing the time period into a plurality of consecutive sub-time-periods based on a predetermined time interval; determining a plurality of I/O write numbers associated with the plurality of sub-time-periods based on the I/O write records; and graphically presenting the plurality of I/O write numbers in chronological order. Using the technical solution of the present disclosure, changes in the I/O write numbers over time can be presented to a user in a chronological, intuitive, and easily recognizable manner, so that the user can easily find a changing law of the I/O write numbers over time, and can further select data protection forms and schedules to be adopted, thereby improving user experience of the user with needs for data analysis and data protection.

Abstract: A method, computer program product, and computing system for receiving a request from a client device to access a file stored in a storage system configured to be communicatively coupled to a plurality of client devices. It may be determined whether to delegate the file to the requesting client device based upon, at least in part, a reinforcement learning model, thus defining a file delegation determination. An access pattern associated with the file may be monitored. The reinforcement learning model may be updated based upon, at least in part, the monitored access pattern associated with the file and the file delegation determination.

Abstract: Techniques for data processing involve: determining, from a disk array, a target disk used for data reconstruction of the disk array; and sending, to an indicating apparatus associated with the target disk, an indication that the target disk is used for the data reconstruction. In this way, such techniques can indicate to the user that the target disk is being used for data reconstruction to remind the user not to remove or move the target disk, thereby ensuring completion of the data reconstruction. Such a technique may improve data storage equipment operation by preventing user interference.

Abstract: A group of state data of storage space in a storage system is collected according to a predetermined time interval, the group of state data being collected at a group of time points, respectively, and the group of time points being divided according to the predetermined time interval. The group of state data is compared with a threshold condition of the storage system, the threshold condition representing that storage space in the storage system is to be exhausted. An association relationship between a state of storage space in the storage system and a future time point is generated based on the group of state data in accordance with determining at least one state data in the group of state data satisfies the threshold condition. A state estimate of storage space in the storage system at a specified future time point is obtained based on the generated association relationship.

Abstract: Techniques perform snapshot deletion. Such techniques involve: determining an object associated with a to-be-executed snapshot deletion request in a snapshot deletion request list of a storage system; in response to the object being included in a predefined set of objects, determining information associated with the to-be-executed snapshot deletion request, the information including at least one of: a number of snapshot deletion requests in the snapshot deletion request list which correspond to snapshots associated with the object, and a waiting time of the to-be-executed snapshot deletion request in the snapshot deletion request list; determining, based on the information and from the snapshot deletion request list, a set of snapshot deletion requests associated with the object; and deleting snapshots corresponding to snapshot deletion requests in the set. Accordingly, the performance of snapshot deletion operations may be improved without any impact on other service on the storage system.

Abstract: Techniques process an access management permission. Such techniques involve: receiving, from a client, a first request for obtaining an access management permission of a file. The techniques further involve: obtaining a current score of the file, wherein the current score indicates a probability of receiving, after the access management permission is assigned to the client, a second request conflicting with the first request. The techniques further involve: assigning the access management permission to the client if it is determined that the current score is greater than or equal to a threshold score. Such techniques alleviate the need to assign, to a client, the access management permission of a file with a high probability of an access conflict, thus enhancing the performance of the server as well as the user experience.

Abstract: Techniques involve: determining, based on sizes of a storage space used by a file system at a set of historical moments and a current moment, predicted sizes of a storage space to be used by the file system at a plurality of future moments. The techniques further involve: determining sizes of an available storage space and available durations of a set of candidate future moments in the plurality of future moments based on the predicted sizes. The techniques further involve: determining, based on the sizes of the available storage space and the available durations of the set of candidate future moments, predicted values that characterize available storage capacities of the set of candidate future moments. The techniques further involve: determining a target moment from the set of candidate future moments based on the predicted values to recycle at least part of an available storage space of the target moment.

Abstract: Techniques perform data processing. Such techniques involve: generating, based on a time sequence that a plurality of requests are detected, a first-input first-output (FIFO) queue comprising the plurality of requests sent by a plurality of storage pools in a storage system for reclaiming storage spaces of the plurality of storage pools. Such techniques further involve: determining respective available storage spaces of the plurality of storage pools. Such techniques further involve: updating, based on the available storage spaces, a sequence of the plurality of requests in the FIFO queue for processing. Such techniques can effectively alleviate the problem that the storage pools are short of storage spaces.

Abstract: Techniques for data processing involve: determining, from a disk array, a target disk used for data reconstruction of the disk array; and sending, to an indicating apparatus associated with the target disk, an indication that the target disk is used for the data reconstruction. In this way, such techniques can indicate to the user that the target disk is being used for data reconstruction to remind the user not to remove or move the target disk, thereby ensuring completion of the data reconstruction. Such a technique may improve data storage equipment operation by preventing user interference.

Abstract: A group of state data of storage space in a storage system is collected according to a predetermined time interval, the group of state data being collected at a group of time points, respectively, and the group of time points being divided according to the predetermined time interval. The group of state data is compared with a threshold condition of the storage system, the threshold condition representing that storage space in the storage system is to be exhausted. An association relationship between a state of storage space in the storage system and a future time point is generated based on the group of state data in accordance with determining at least one state data in the group of state data satisfies the threshold condition. A state estimate of storage space in the storage system at a specified future time point is obtained based on the generated association relationship.