Abstract: A sub-archive is initiated. The sub-archive saves changes that have occurred since a previous final archive. Changes to an operational database (i.e., the operational database that is being archived) are allowed during the first sub-archive. A final archive is initiated in series after the sub-archive has completed. The final archive does not allow changes to the operational database when the final archive is active. In one embodiment, the sub-archive may comprise a plurality of sub-archives that depend on an amount of outstanding changes that exist in the operational database.

Abstract: A sub-archive is initiated. The sub-archive saves changes that have occurred since a previous final archive. Changes to an operational database (i.e., the operational database that is being archived) are allowed during the first sub-archive. A final archive is initiated in series after the sub-archive has completed. The final archive does not allow changes to the operational database when the final archive is active. In one embodiment, the sub-archive may comprise a plurality of sub-archives that depend on an amount of outstanding changes that exist in the operational database.

Abstract: A sub-archive is initiated. The sub-archive saves changes that have occurred since a previous final archive. Changes to an operational database (i.e., the operational database that is being archived) are allowed during the first sub-archive. A final archive is initiated in series after the sub-archive has completed. The final archive does not allow changes to the operational database when the final archive is active. In one embodiment, the sub-archive may comprise a plurality of sub-archives that depend on an amount of outstanding changes that exist in the operational database.

Abstract: In some examples, a computer receives event data relating to events of a system, and builds a graph comprising nodes representing respective values of attributes of the events, and edges between the nodes, each respective edge of the edges representing co-occurrence of values of attributes represented by nodes connected by the respective edge. The computer computes edge weights of corresponding edges of the edges, and identifies paths in the graph, where each path of the paths comprises two or more nodes and a corresponding edge or edges. The computer determines an affinity among the values of the attributes based on a shortest path determining process that uses the edge weights for distances of the identified paths, and resolves an anomaly in the system based on the determined affinity.

Abstract: In some examples, a computer receives event data relating to events of a system, and builds a graph comprising nodes representing respective values of attributes of the events, and edges between the nodes, each respective edge of the edges representing co-occurrence of values of attributes represented by nodes connected by the respective edge. The computer computes edge weights of corresponding edges of the edges, and identifies paths in the graph, where each path of the paths comprises two or more nodes and a corresponding edge or edges. The computer determines an affinity among the values of the attributes based on a shortest path determining process that uses the edge weights for distances of the identified paths, and resolves an anomaly in the system based on the determined affinity.

Abstract: A sample set of security accounts and a security permissions profile are obtained. Similarity index values are calculated for the accounts. The values are compared against a threshold range and identified as accounts that are certified for access review and as outliers that require additional access review.