Abstract: A user interface facilitates a user designing one or more logging pipelines that may run concurrently on a computer system for logging information relative to one or more respective application. Custom object instances that run in a POD facilitate translating the applications’ formats, protocols, and rules for use by generic logging function components selected by the user when designing the pipelines. The custom object instances facilitate updates to a given pipeline being implemented without affecting other active pipelines that are logging application activity.

Abstract: Data storage is disclosed. For instance, a request for storing target data is received including the target data and indicating the number of copies of the target data to be stored, based upon which storage chunks for storing the target data are allocated. Each storage chunk includes a data segment and a coding segment, and a group of the storage chunks are respectively configured to store a number of copies of the target data. The first number of copies are written to the data segment of each storage chunk in the group respectively. For one of the group of storage chunks, first check information is generated for checking data stored in the data segment of the storage chunk. Further, the first check information is written to the coding segment of each storage chunk in the group of storage chunks. The efficiency of multi-copy data storage is increased while reducing memory consumption.

Abstract: Data storage is disclosed. For instance, a request for storing target data is received including the target data and indicating the number of copies of the target data to be stored, based upon which storage chunks for storing the target data are allocated. Each storage chunk includes a data segment and a coding segment, and a group of the storage chunks are respectively configured to store a number of copies of the target data. The first number of copies are written to the data segment of each storage chunk in the group respectively. For one of the group of storage chunks, first check information is generated for checking data stored in the data segment of the storage chunk. Further, the first check information is written to the coding segment of each storage chunk in the group of storage chunks. The efficiency of multi-copy data storage is increased while reducing memory consumption.

Abstract: Embodiments of the present disclosure provide a method and device for storing data. The method comprises: generating a data block corresponding to data to be stored; aligning the data block to a boundary of a tracking unit of a predefined size for validating the data; and storing the aligned data block in at least one storage unit of a storage space, the at least one storage unit having an identical size. The method according to embodiments of the present disclosure can align the data block so as to minimize the waste of storage space and avoid the situation where the rest data cannot be validated due to disappearance of partial data.

Abstract: Embodiments of the present disclosure provide a method, a device and a computer program product for data processing. The method comprises in response to data associated with an object being stored in the storage location, generating an entry indicating a first association relationship between the data and a storage location. The method further comprises generating metadata of the object, the metadata indicating a second association relationship between the object and the entry. Further, the method comprises in response to the first association relationship between the data and the storage location being changed, updating the entry independent of the metadata. Embodiments of the present disclosure may avoid the huge cost caused by changing metadata multiple times and reduce the system load and the impacts to the front end load.

Abstract: In an example, a method comprises determining, based on a set of metadata items to be stored, a first sequence and a second sequence, wherein the first sequence and the second sequence each include a plurality of key-value pairs, each key-value pair including a metadata item from the set of metadata items and a keyword corresponding to the metadata item in the set. The method also comprises causing a first co-routine to utilize available computing resources to process the first sequence. The method further comprises in response to an amount of computing resources available for the first co-routine to process the first sequence being below a first threshold, causing a second co-routine to process the second sequence, wherein the second co-routine is different from the first co-routine. This method can increase the utilization rate of the processor and more rapidly stores the metadata into the external storage device.

Abstract: The disclosed technology generally describes separating types of data chunks in a copy-on-write/MVCC B+ tree, chunk-based data storage system, and also allocating the sizes of leaf chunks to be smaller than that of other (e.g., internal and root node) chunks. By having leaf chunks separate from node chunks, the probability of having a fully reclaimable (without copying) chunk is increased. Similarly, by having smaller sized leaf chunks relative to node chunks, the probability of having a fully reclaimable (without copying) leaf chunks is increased. The technology thus facilitates more efficient garbage collection.

Abstract: A technique of managing storage includes receiving a request to change an initial portion of data, the initial portion of data (i) associated with an initial redundant region and (ii) including a first segment to be changed and a set of other segments not to be changed; updating the first segment in response to the request; and generating an updated redundant region based on a computation involving the initial redundant region and the first segment but not involving the set of other segments.

Abstract: Embodiments of the present disclosure provide a method, apparatus, and computer program product for storing data. A method for storing data comprises: dividing data to be stored into a first number of data segments; generating a second number of coding segments based on the first number of data segments, such that at least a part of data segments from the first number of data segments can be derived from the second number of coding segments and remaining data segments in the first number of data segments; generating, for each of the first number of data segments, a replication data segment identical to the data segment; and storing the first number of data segments, the first number of replication data segments and the second number of coding segments into a plurality of storage devices. Embodiments of the present disclosure can reduce extra overhead for protecting data while ensuring high data availability.

Abstract: A method, apparatus and computer program product for managing a storage system are provided. For example, in a method, a tree index of the storage system is obtained, where a leaf node among multiple leaf nodes in the tree index comprising a keyword and an attribute of an object among multiple objects in the storage system. Respective attributes of nodes in a set of the multiple leaf nodes in the tree index are obtained, and the set of the multiple leaf nodes having a same parent node. The tree index is updated based on respective attributes of the leaf nodes in the set of the multiple leaf nodes. With the above example implementations, performance of the index of the storage system can be increased, and further overall response speed of the storage system can be improved. Further, there is provided an apparatus and computer program product for managing a storage system.

Abstract: Embodiments of the present disclosure provide a method, a device and a computer program product of storage management. According to example implementations of the present disclosure, in response to data to be replicated from a first storage zone to a second storage zone, a utilization rate of resources associated with the replication is determined; the utilization rate of the resources is compared with a predetermined threshold utilization rate; and in response to the utilization rate of the resources being less than the threshold utilization rate, the replication of the data is initiated from the first storage zone to the second storage zone. Therefore, the present disclosure can automatically adjust replication behaviors for various scenarios, thereby realizing a more flexible data replication policy, and enabling more efficient use of various resources.

Abstract: A method of controlling a hard disk and an electronic device, comprising: determining a number of power cycles that have been completed by the hard disk at a time point within a predetermined period of time, a power cycle including a total duration of the hard disk in a spin-on mode and an immediately neighboring spin-off mode; and in response to the number of power cycles that have been completed being below an upper limit number for the power cycles of the hard disk in the predetermined period of time, determining remaining time of the predetermined period of time starting from the time point, and determining, based on the remaining time, the number of power cycles that have been completed, and the upper limit number, a threshold idle duration for controlling the hard disk to enter the spin-off mode.

Abstract: Techniques for monitoring an access request are described. For instance, a method comprises: obtaining a request parameter indicating a target storage space to which the access request is directed; determining a target address range of the target storage space based on the request parameter; determining, in a set of kernel logs, a target kernel log associated with the access request based on the target address range, the set of kernel logs recording operations that occur in a kernel of an operating system; and determining information of an operation of the access request based on the kernel log, the operation corresponding to the target kernel log.

Abstract: The disclosed technology generally describes separating types of data chunks in a copy-on-write/MVCC B+ tree, chunk-based data storage system, and also allocating the sizes of leaf chunks to be smaller than that of other (e.g., internal and root node) chunks. By having leaf chunks separate from node chunks, the probability of having a fully reclaimable (without copying) chunk is increased. Similarly, by having smaller sized leaf chunks relative to node chunks, the probability of having a fully reclaimable (without copying) leaf chunks is increased. The technology thus facilitates more efficient garbage collection.

Abstract: Embodiments of the present disclosure provide methods, apparatuses, a system and computer program products for managing storage units. According to embodiments of the present disclosure, it is determined whether a first storage unit allocated at a first node is reclaimable, wherein data in the first storage unit is backed up to a second storage unit at a second node. In response to determining that the first storage unit is reclaimable, a condition to be satisfied for reclaiming the second storage unit is determined. A command indicating the condition is sent to the second node, such that the second node reclaims the second storage unit in response to the condition being satisfied. Moreover, in response to the command being sent, the first storage unit is reclaimed. The embodiments of the present disclosure enable timely reclaiming of storage units, thereby improving utilization of the storage space effectively.

Abstract: Techniques for monitoring an access request are described. For instance, a method comprises: obtaining a request parameter indicating a target storage space to which the access request is directed; determining a target address range of the target storage space based on the request parameter; determining, in a set of kernel logs, a target kernel log associated with the access request based on the target address range, the set of kernel logs recording operations that occur in a kernel of an operating system; and determining information of an operation of the access request based on the kernel log, the operation corresponding to the target kernel log.

Abstract: Embodiments of the present disclosure provide a method, apparatus, and computer program product for storing data. A method for storing data comprises: dividing data to be stored into a first number of data segments; generating a second number of coding segments based on the first number of data segments, such that at least a part of data segments from the first number of data segments can be derived from the second number of coding segments and remaining data segments in the first number of data segments; generating, for each of the first number of data segments, a replication data segment identical to the data segment; and storing the first number of data segments, the first number of replication data segments and the second number of coding segments into a plurality of storage devices. Embodiments of the present disclosure can reduce extra overhead for protecting data while ensuring high data availability.

Abstract: Embodiments of the present disclosure provide a method, a device and a computer program product for data processing. The method comprises in response to data associated with an object being stored in the storage location, generating an entry indicating a first association relationship between the data and a storage location. The method further comprises generating metadata of the object, the metadata indicating a second association relationship between the object and the entry. Further, the method comprises in response to the first association relationship between the data and the storage location being changed, updating the entry independent of the metadata. Embodiments of the present disclosure may avoid the huge cost caused by changing metadata multiple times and reduce the system load and the impacts to the front end load.

Abstract: Embodiments of the present disclosure provide a method, electronic device and computer program product for handling congestion of data transmission. The method comprises determining whether congestion caused by a plurality of storage nodes occurs at a first port of a switch, the first port being connected to a first storage node, the plurality of storage nodes transmitting data to the first storage node via the first port of the switch. The method further comprises in response to determining that the congestion occurs at the first port, selecting at least a second storage node from the plurality of storage nodes. The method further comprises updating configuration of a data transmission path for the second storage node, such that the second storage node transmits data to the first storage node while bypassing the first port.

Abstract: Embodiments of the present disclosure provide a method, a device and a computer program product for storing metadata. The method comprises determining, based on a set of metadata items to be stored, a first sequence and a second sequence, wherein the first sequence and the second sequence each include a plurality of key-value pairs, each key-value pair including a metadata item from the set of metadata items and a keyword corresponding to the metadata item in the set. The method also comprises causing a first co-routine to utilize available computing resources to process the first sequence. The method further comprises in response to an amount of computing resources available for the first co-routine to process the first sequence being below a first threshold, causing a second co-routine to process the second sequence, wherein the second co-routine is different from the first co-routine.