Abstract: According to embodiments of the present disclosure, a method, device and computer program product for information processing are proposed. The method comprises: obtaining identification information of a shard of metadata at a first node of a blockchain-based metadata management system; determining, based on similarities of the identification information of the shard and identification information of candidate nodes of the metadata management system, a second node for positioning the shard from the candidate nodes; and enabling the second node to process the identification information of the shard, to manage storage of the shard in the metadata management system. Therefore, the present solution can improve efficiency, security and robustness of the metadata management system.

Abstract: Methods and systems for searching directory access groups are disclosed. A set of groups associated with a logon user is determined. The set of groups is partitioned into one or more disjoint subsets, wherein each of the disjoint subsets is represented by a data representation including a root node and one or more intermediate nodes. For each of the disjoint subsets, the disjoint subset is path compressed to flatten a structure of the data representation representing the disjoint subset. The data representation is cached to a database cache.

Abstract: According to one embodiment, one or more consistent states of a virtual machine (VM) are backed up and stored. An index library is used to extract, from the consistent state(s) of the VM, metadata corresponding to content files captured in the consistent state(s). The extracted metadata is stored into a metadata catalog, where the metadata catalog is subsequently downloaded by an index server to index the content files captured in the consistent state(s).

Abstract: A distributed search framework with virtual indexing is disclosed. According to some embodiments, a virtual index that includes a first physical index is created, where the first physical index includes a first number of shards. A request to index a document is received. In response to the request, whether the first physical index has reached a capacity threshold is determined. In response to determining that the first physical index has reached the capacity threshold, a second physical index is automatically created and added to the virtual index, where the second physical index includes a second number of shards. The document is added into the second physical index.

Abstract: According to embodiments of the present disclosure, a method, device and computer program product for information processing are proposed. The method comprises: obtaining identification information of a shard of metadata at a first node of a blockchain-based metadata management system; determining, based on similarities of the identification information of the shard and identification information of candidate nodes of the metadata management system, a second node for positioning the shard from the candidate nodes; and enabling the second node to process the identification information of the shard, to manage storage of the shard in the metadata management system. Therefore, the present solution can improve efficiency, security and robustness of the metadata management system.

Abstract: According to one embodiment, one or more consistent states of a virtual machine (VM) are backed up and stored. An index library is used to extract, from the consistent state(s) of the VM, metadata corresponding to content files captured in the consistent state(s). The extracted metadata is stored into a metadata catalog, where the metadata catalog is subsequently downloaded by an index server to index the content files captured in the consistent state(s).

Abstract: Methods and systems for searching directory access groups are disclosed. A set of groups associated with a logon user is determined. The set of groups is partitioned into one or more disjoint subsets, wherein each of the disjoint subsets is represented by a data representation including a root node and one or more intermediate nodes. For each of the disjoint subsets, the disjoint subset is path compressed to flatten a structure of the data representation representing the disjoint subset. The data representation is cached to a database cache.

Abstract: A distributed search framework with virtual indexing is disclosed. According to some embodiments, a virtual index that includes a first physical index is created, where the first physical index includes a first number of shards. A request to index a document is received. In response to the request, whether the first physical index has reached a capacity threshold is determined. In response to determining that the first physical index has reached the capacity threshold, a second physical index is automatically created and added to the virtual index, where the second physical index includes a second number of shards. The document is added into the second physical index.