Abstract:
A data management system and method of managing call data for at least one radio network element within a cellular communication network. The method comprising receiving call data for at least one call from the at least one radio network element within the cellular communication network, arranging the received call data into call data records of a non-fixed size, and writing the call data records to at least one data storage device such that the call data records are stored adjacent one another.
Abstract:
A system that displays performance data for a computing environment. During operation, the system determines performance states for a plurality of entities that comprise the computing environment based on values of a performance metric for the entities. Next, the system displays the computing environment as a tree comprising nodes representing the plurality of entities and edges representing parent-child relationships between the plurality of entities. Then, for each parent node in the tree, the system determines counts of one or more performance states for descendants of the parent node in the tree. Finally, the system displays a graphical representation of the determined counts while displaying the parent node. In some embodiments, displaying the graphical representation of the determined counts includes displaying a circular ring comprising visually distinct sections associated with different performance states, wherein the visually distinct sections are sized proportionately with the determined counts for the associated performance states.
Abstract:
A logging unit is used to log entries for events in a computer system. Each entry includes an n-bit timestamp field and a payload. The payload includes information about the event and the timestamp field includes the n least significant bits of an N-bit timestamp for the event, where N>n. If the n least significant bits of the timestamp have wrapped compared to the corresponding n bits of the timestamp of the preceding entry then a timing entry is logged which includes other bits of the timestamp. Therefore, an N-bit timestamp can be determined for an event, but only the n least significant bits of the timestamp are stored in the timestamp field of an entry for the event. Therefore, the time flow of events in the store is better maintained (by having a larger timestamp) without increasing the number of bits (n) in the timestamp field of each entry.
Abstract:
A system and methods for backing up and restoring updates to metadata of files stored in a database are disclosed. One example embodiment of the method includes entering the updates to the metadata of the one or more files into a first database table; generating a backup file of the first database table; and restoring the updates to the metadata to the one or more files using the backup file. Restoring the updates may include creating a recovery table populated with data from the backup file; determining the one or more files to apply the updates to by searching the recovery table for an identifier of the one or more files; and adding the updates to the metadata from the recovery table to the corresponding one or more files that matches the identifier identified from the recovery table.
Abstract:
A system that displays performance data for a computing environment. During operation, the system determines performance states for a plurality of entities that comprise the computing environment based on values of a performance metric for the entities. Next, the system displays the computing environment as a tree comprising nodes representing the plurality of entities and edges representing parent-child relationships between the plurality of entities. Then, for each parent node in the tree, the system determines counts of one or more performance states for descendants of the parent node in the tree. Finally, the system displays a graphical representation of the determined counts while displaying the parent node. In some embodiments, displaying the graphical representation of the determined counts includes displaying a circular ring comprising visually distinct sections associated with different performance states, wherein the visually distinct sections are sized proportionately with the determined counts for the associated performance states.
Abstract:
A solution for validating a set of data protection solutions is provided. A validation scenario can be defined, which can include data corresponding to a set of attributes for the validation scenario. The attributes can include a time frame for the validation scenario. The validation scenario also can include a set of backup images to be validated, each of which is generated using one of the set of data protection solutions. The set of backup images can be identified using the time frame. A set of resource requirements for implementing the validation scenario can be determined based on the set of backup images and the set of attributes for the validation scenario.
Abstract:
A system, method, and computer program product for a block-based backing up a storage device to an object storage service is provided. This includes the generation of a data object that encapsulates a data of a data extent. The data extent covers a block address range of the storage device. The data object is named with a base name that represents a logical block address (LBA) of the data extent. The base name is appended with an identifier that deterministically identifies a recovery point that the data object is associated with. The base name combined with the identifier represents a data object name for the data object. The named data object is then transmitted to the object storage service for backup of the data extent. At an initial backup, the full storage device is copied. In incremental backups afterwards, only those data extents that changed are backed up.
Abstract:
In an approach, a database server maintains a container database which comprises: one or more pluggable databases, a root database that stores an undo log for rolling back transactions on the consolidated database, and a redo log for replaying modifications to the container database. The database server restores a particular pluggable with a backup version that corresponds to a first point in time. The database server generates a clone database loaded with a backup version of the root database that corresponds to the first point in time. The database server applies the redo log to recover the particular pluggable database and the clone database to a second point in time that is later than the first point in time. The database server identifies, based on the clone database, one or more active transactions on the particular pluggable database. The database server rolls back the one or more active transactions.
Abstract:
Efficient logging in a control system. Register update requests to store data values in one or more of a plurality of primary registers are received. The most frequently updated primary registers of the plurality of primary registers are periodically identifying. A shadow register is associated with each of the identified most frequently updated primary registers. In response to receiving a register update request to store a data value in one of the most frequently updated primary registers, it is determined if the data value to store is different than the data value stored in the shadow register associated with the register to update. If so, the data value to store is stored into the register to update, stored into the shadow register associated with the register to update, and a log entry corresponding to the register update request is stored in an event log file.