Embodiments are directed to managing file systems over a network. A hierarchical index may be provided based on a file system and a plurality of objects stored in the file system A token index may be generated based on the hierarchical index. Each token may be a portion of the path of the objects Metric indices may be generated based on the hierarchical index and a plurality of metrics associated with the objects such that the metrics indices include one or more rows that corresponds to a place position for a metric value. Employing the token index and the metric indices to generate query results based on the plurality of metrics associated with the objects.

Provided are a metadata processing method and apparatus, and a computer-readable storage medium. In the metadata processing method, a management server obtains metadata to be processed, wherein the metadata to be processed includes a directory structure and file attributes; and according to a load condition of at least one first node for storing the file attributes and based on a rule that file attributes of a same directory are stored in a same first node, the management server stores, in the at least one first node, the file attributes of directories in the directory structure in a distributed manner.

Disclosed herein is a system and method for enabling creating and managing structured tables on a blockchain thereby facilitating retrieval of data records with standard database operational commands and in a structured manner. Creating structured tables as per a defined schema provides for data storage in a manner which enables easy integration with existing business applications. Further, the system and method provides for storing unstructured data records in a structured manner in the blockchain.

Embodiments are directed to managing file systems over a network. A hierarchical index may be provided based on a file system and a plurality of objects stored in the file system A token index may be generated based on the hierarchical index. Each token may be a portion of the path of the objects Metric indices may be generated based on the hierarchical index and a plurality of metrics associated with the objects such that the metrics indices include one or more rows that corresponds to a place position for a metric value. Employing the token index and the metric indices to generate query results based on the plurality of metrics associated with the objects.

Examples for managing requests to a data shard, are described. In an example, incoming data being stored in a first data shard within a first set of data shards may be monitored. Based on the monitoring, a second data shard within a second set of data shards may be identified. In an example, the second data shard may correspond to the first data shard. Thereafter, an identifier of the second data shard may be associated with to the first data shard. Once associated with the first data shard, subsequent data requests corresponding to the retrieved identifier may be redirected to the first data shard.

A size associated with a content file is determined to be greater than a threshold size. In response to the determination, file metadata of the content file split and stored across a plurality of component file metadata structures. The file metadata of the content file specifies tree structure organizing data components of the content file and each component file metadata structure of the plurality of component file metadata structures stores a portion of the tree structure. A snapshot tree is updated to reference the plurality of component file metadata structures for the content file.

An indexing technique provides an index data structure for efficient retrieval of a snapshot from a long-term storage service (LTSS) of an archival storage system. The snapshot is generated from typed data of a logical entity, such as a virtual disk (vdisk). The data of the snapshot is replicated to a frontend data service of the LTSS sequentially and organized as one or more data objects for storage by a backend data service of LTSS in an object store of the archival storage system. Metadata associated with the snapshot (i.e., snapshot metadata) is recorded as a log and persistently stored on storage media local to the frontend data service. The snapshot metadata includes information describing the snapshot data, e.g., a logical offset range of a snapshot of the vdisk and, thus, is used to construct the index data structure. Notably, construction of the index data structure is deferred until after the entirety of the snapshot data has been replicated and received by the frontend data service.

Embodiments of method and system are directed to a best effort method to reconstruct the corrupt files from available nodes or tiers and heal or repair the corrupt files. The method looks for the existence of fingerprints of the lost segments in available tiers on the nodes or across nodes within a cluster. The method discovers the copies of these missing segments, creates an Lp tree referring these discovered segments and creates a virtual file in the namespace. The file is then moved to the destination tier where the corruption exists, thus healing the corruption.

A pervasive search architecture that indexes personal content of a querying user and made accessible to the user by other users. A compute node of a personal content location facilitates index generation and serve of the index. The index is generated for personal content stored at the personal content location. For a given content location, the index may encapsulate content stored in a set of locations with access permissions. The indexing application runs periodically at the personal content location and incrementally indexes content that is added to the shared locations. The same application allows the user to configure locations with the desired access permissions for participation in the search.

Methods, non-transitory machine readable media, and computing devices that provide more efficient hierarchical propagation in tree structures are disclosed. With this technology, a first delta record for a first interior node is created optionally in an atomic transaction along with updating a first tally record for a leaf node based on a first value. The transaction is in response to an action associated with the leaf node and the first interior node is a parent of the leaf node in a hierarchical tree. A timer associated with the first delta record is then set. A second value is updated in a second tally record for the first interior node based on the first value, when the timer has expired. Accordingly, this technology advantageously maintains recursive properties or values throughout a hierarchical tree continually, with reduced cost, even in a distributed network and in hierarchical trees with large numbers of nodes.