Abstract: The technologies described herein are generally directed toward using differential checkpoints to maintain a data store of file system metadata. For instance, a system can, based on a comparison of a first metadata state capture of a data storage system with a second metadata state capture, identify changed metadata of a data object. The system can further, based on the changed metadata, generate a metadata checkpoint object. Further, the system can receive an indication from a consumer process that, the metadata checkpoint object has been processed to generate a data modification command configured to be received by a record system node, and to change contents of a record system, and the data modification command has been processed by the record system node to alter the contents of the record system based on the data modification command.

Abstract: The technologies described herein are generally directed toward using differential checkpoints to search non-logical file system metadata. For instance, a system can, based on a comparison of a first metadata state capture of a data storage system with a second metadata state capture, identify changed metadata of a data object. The system can further, based on the changed metadata, generate a metadata checkpoint object. Further, the system can receive an indication from a consumer process that, the metadata checkpoint object has been processed to generate a data modification command configured to be received by a record system node, and to change contents of a record system, and the data modification command has been processed by the record system node to alter the contents of the record system based on the data modification command.

Abstract: The described technology is generally directed towards maintaining a heat score per file based on a file's access/activity level, and using the heat score to re-tier files from faster to slower storage and vice-versa. Files on a slower tier that have more activity are thereby moved (“up-tiered”) to a faster access storage tier, while the files that have less activity on the faster access storage tier are moved (“down-tiered”) to a slower access storage tier. The heat score for a file is increased based on more input-output operation activity, and decayed over time. The decaying can be based on a relative importance value (e.g., business value) assigned to the file or a domain that includes the file. Ordering the files based on their respective heat scores allows only a fraction of the files to be considered for re-tiering before the re-tiering moves are performed.

Abstract: The described technology is generally directed an extension to the IFS domains architecture, referred to herein as filter domains. IFS domains allows tagging of files in a tree-like dataset. Thus, a domain can be defined at the root of the dataset such as the topmost directory under which all files reside. These domains are inherently hierarchical, path-based entities. Filter domains extends this organization to allow domains to be applied beyond hierarchical tree structures in order to also provide arbitrary grouping of file objects based on any suitable membership condition.

Abstract: A method for dynamic cluster member role selection based on available resources includes monitoring, by a system including a processor, operational states of resource elements of a computing device in a computing cluster. The method also includes, in response to determining, via the monitoring, that a first resource element of the resource elements has transitioned between a functioning operational state and a non-functioning operational state, assigning, by the system, a computational function to the computing device based on second resource elements, of the resource elements, having the functioning operational state.

Abstract: The described technology is generally directed towards maintaining a heat score per file based on a file's access/activity level, and using the heat score to re-tier files from faster to slower storage and vice-versa. Files on a slower tier that have more activity are thereby moved (“up-tiered”) to a faster access storage tier, while the files that have less activity on the faster access storage tier are moved (“down-tiered”) to a slower access storage tier. The heat score for a file is increased based on more input-output operation activity, and decayed over time. The decaying can be based on a relative importance value (e.g., business value) assigned to the file or a domain that includes the file. Ordering the files based on their respective heat scores allows only a fraction of the files to be considered for re-tiering before the re-tiering moves are performed.

Abstract: The described technology is generally directed an extension to the IFS domains architecture, referred to herein as filter domains. IFS domains allows tagging of files in a tree-like dataset. Thus, a domain can be defined at the root of the dataset such as the topmost directory under which all files reside. These domains are inherently hierarchichal, path-based entities. Filter domains extends this organization to allow domains to be applied beyond hierarchical tree structures in order to also provide arbitrary grouping of file objects based on any suitable membership condition.

Abstract: Techniques are provided for providing data across multiple clusters in a single namespace. In an example, a first cluster can comprise an accelerator node that communicates with a client computer, and is configured both to refer the client computer to another cluster, and to proxy data from another cluster to the client. When the client computer accesses data at a junction in the namespace between the first cluster and a second cluster, the accelerator node can determine whether to refer the client computer or proxy the client computer. Then, the accelerator node can use this determined approach so that the client computer can access data from the second cluster.

Abstract: Techniques are provided for providing data across multiple clusters in a single namespace. In an example, a first cluster can comprise an accelerator node that communicates with a client computer, and is configured both to refer the client computer to another cluster, and to proxy data from another cluster to the client. When the client computer accesses data at a junction in the namespace between the first cluster and a second cluster, the accelerator node can determine whether to refer the client computer or proxy the client computer. Then, the accelerator node can use this determined approach so that the client computer can access data from the second cluster.