Embodiments provide for identifying and resolving conflicts in access permissions migrated data by receiving a set of mappings including path mappings of a hierarchy of data objects on the source system to locations on the target system for migrated data objects. Based on the received set of mappings, permissions controlling access to data objects of the hierarchy of data objects on the source system can be translated to permissions controlling access to the migrated data objects on the target system for one or more user accounts on the target system. One or more conflicts can be detected between permissions on the source system and permissions on the target system. A conflict resolution strategy can be selected from a plurality of conflict resolution strategies and the selected conflict resolution strategy can be applied to the permissions controlling access to the migrated data objects on the target system.

A method and system for determining a set of accounting data structure (ADS) chains including a first ADS chain, a second ADS chain, a third ADS chain, and a fourth ADS chain; determining a first connection data structure (CDS); determining a second CDS; determining a set of mutually exclusive partitions including a first partition and a second partition, wherein the first partition and second partition are mutually exclusive in that no CDS links an ODS in an ADS chain associated with the first partition to an ODS in an ADS chain associated with the second partition; assigning the first partition to a first set of computational resources; and assigning the second partition to a second set of computational resources are described.

Embodiments for enabling granular migration of data with high efficiency. A defined metadata element, a tag, is assigned to each file, and then tag filtering is used to direct the data to the proper location. Files with different tags can be selected for transfer, and such a group of tags is referred to as a tag set. Embodiments can be used with a defined backup system file migration process, such as present in the Data Domain File System. By using snapshots, incoming new data (ingested file) is allowed to continue while the migration is in process and maintaining data consistency at the same time. This is achieved by performing operations on B+ Tree snapshots in conjunction with tag filtering on keys present in the leaf pages of these structures. This method is efficient became it makes a single pass walk of a B+ Tree in contrast with previous methods that look up files one-by-one via their pathname.

An apparatus includes a memory and a processor. The memory stores a time-series of data sets, and a first version of a data structure generated from the time-series as it existed at a first time. The data structure includes a terminal node that stores a compressed representation of the time-series and a bottom level of nodes, each of which stores a hash of a data set of the time-series. The processor generates a second version of the data structure based on the time-series as it exists at a second time. The processor determines that the data stored by the terminal nodes in the first and second versions do not match. In response, the processor identifies a bottom level node for which the stored data in the first and second versions do not match, and requests validation. The processor receives a response indicating whether an intentional change was made.

The present disclosure is directed to systems and methods of managing remote devices. The system can include a server with memory, a detection module, and a collection module. The memory can store a management information base (MIB) having a hierarchical tree of object identifiers and corresponding object values. The detection module can query devices and receive a first object identifier and its first object value, which can vary from those in the MIB; and use patterns to match the first object identifier and object value; and generate an identification of the device from the matches. The collection module can use the identification to select a collection template, which can indicate a subtree of the MIB and a collection pattern; traverse the subtree and identify a second object identifier that matches the collection pattern, and its second object value; and associate the second object value with the first object value.

A digital security system can store data associated with entities in resolver trees. If the digital security system determines that two resolver trees are likely representing the same entity, the digital security system can use a merge operation to merge the resolver trees into a single resolver tree that represents the entity. The single resolver tree can include a merge node indicating a merge identifier of the merge operation. Nodes containing information merged into the resolver tree from another resolver tree during the merge operation can be tagged with the corresponding merge identifier. Accordingly, if the merge operation is to be undone, for instance if subsequent information indicates that the entries are likely separate entities, the resolver tree can be unmerged and the nodes tagged with the merge identifier can be restored to a separate resolver tree.

Embodiments of methods, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed. In particular, methods, apparatus devices and or/or systems for enumerating rooted partial subtrees are disclosed.

A method for storing or transmitting information may include determining at least one subdivision of at least one logical hierarchical data space. The at least one logical hierarchical data space may have a plurality of subdivisions. The method may further include creating at least one data block. The method may further include writing the at least one tuple to the at least one data block. The at least one tuple may be associated with the subdivision of the at least one logical hierarchical data space. The method may further include associating the at least one data block with the at least one subdivision of the at least one logical hierarchical data space.

In some aspects, a computing system may generate a content-defined tree. A content-defined tree may be a tree of cryptographic hashes where each leaf is a hash of a chunk (e.g., data chunk) of a data object, and each parent node (e.g., interior node) is the hash of a concatenation of the hashes of the parent's children nodes. To create parent nodes for the leaf nodes, a computing system may group leaf nodes together based on a rolling hash (e.g., a rolling hash of the hashes of the leaf nodes) satisfying a condition. Each parent node may include a hash that represents the concatenation of the hashes of the leaf nodes that fall under the corresponding parent node.

In some embodiments, a hierarchical tree may include nodes that each indicates an objective, and each non-root node of the nodes indicates an objective supporting an objective of at least one node with which the non-root node has a direct relationship. Based on a modification to an objective of a given node of the tree, a determination of whether at least one child node of the given node indicates an unsatisfiable objective (e.g., no longer suitably supporting the given node's objective). For a child node of the given node determined to indicate an unsatisfiable objective, a corresponding subset of the tree may be replaced with replacement nodes that each indicates a satisfiable objective (e.g., suitably supporting the given node's objective), where the corresponding subset includes (i) the child node and (ii) descendant nodes of the child node.