Abstract: One embodiment provides a system that facilitates efficient storage and retrieval using erasure coding. During operation, the system determines a finite field solution that conforms to both locality and maximum distance separable (MDS) properties of an erasure-coding system. The system determines a generator matrix of the erasure-coding system based on the finite field solution and generates, from a data element, a plurality of coded fragments based on the generator matrix of the erasure-coding system. The plurality of coded fragments includes a set of enhanced coded fragments that allows reconstruction of the data element and a set of regular coded fragments. The number of the enhanced coded fragments can be fewer than a threshold number of coded fragments for the erasure-coding system.

Abstract: One embodiment provides a system that facilitates numerical operation-based erasure coding. During operation, the system determines the bit-width of processing capability of the computing system. The system then determines, based on the bit-width, a number of bits for representing a respective data element from a data stream and a number of data elements based on a number of a dimension of a generator matrix of erasure encoding. The system then obtains the number of data elements from the data stream and converts a respective obtained data element to a corresponding numerical representation. Here, a respective obtained data element is represented by the determined number of bits. The system then generates a code word, which comprises a plurality of coded fragments, of erasure encoding from the numerical representations based on the generator matrix of the erasure encoding.

Abstract: One embodiment provides a system that facilitates integrated security and high availability. During operation, the system obtains a number of data elements from a data stream based on a number of coded fragments that a code word includes. The system determines one or more bit-level operations for the data elements in such a way that at least one of the one or more bit-level operations becomes eliminated from a process of erasure encoding. The system then obfuscates the data elements based on one or more bit-level operations. Subsequently, the system generates a code word of the erasure encoding from the obfuscated data elements based on the generator matrix. The code word comprises a plurality of coded fragments.

Abstract: One embodiment provides a system for analyzing a motion of a complex system. During operation, the system obtains movement data associated with the motion over a time interval and computes, over the time interval, a distribution of energy associated with the motion based on the obtained movement data. The system further identifies energy peaks based on the distribution of the energy over the time interval, computes an energy-occurrence-frequency distribution based on the identified energy peaks over a predetermined energy range, and generates a motion-analysis result for the complex system based on the computed energy-occurrence-frequency distribution.

Abstract: One embodiment provides a system for analyzing a motion. During operation, the system obtains acceleration data associated with the motion. The acceleration data can include three components corresponding to three spatially orthogonal directions. For each orthogonal direction, the system computes an amount of oscillatory energy included in the motion in the orthogonal direction based on a corresponding acceleration component. For at least one orthogonal direction, the system obtains an energy fraction factor by computing a ratio between the amount of the oscillatory energy in the orthogonal direction and a total amount of the oscillator energy. The system generates a motion-analysis output based at least on the energy fraction factor.

Abstract: One embodiment provides a system that facilitates numerical operation-based erasure coding. During operation, the system determines the bit-width of processing capability of the computing system. The system then determines, based on the bit-width, a number of bits for representing a respective data element from a data stream and a number of data elements based on a number of a dimension of a generator matrix of erasure encoding. The system then obtains the number of data elements from the data stream and converts a respective obtained data element to a corresponding numerical representation. Here, a respective obtained data element is represented by the determined number of bits. The system then generates a code word, which comprises a plurality of coded fragments, of erasure encoding from the numerical representations based on the generator matrix of the erasure encoding.

Abstract: One embodiment provides a system that facilitates numerical operation-based erasure coding. During operation, the system determines the bit-width of processing capability of the computing system. The system then determines, based on the bit-width, a number of bits for representing a respective data element from a data stream and a number of data elements based on a number of a dimension of a generator matrix of erasure encoding. The system then obtains the number of data elements from the data stream and converts a respective obtained data element to a corresponding numerical representation. Here, a respective obtained data element is represented by the determined number of bits. The system then generates a code word, which comprises a plurality of coded fragments, of erasure encoding from the numerical representations based on the generator matrix of the erasure encoding.

Abstract: One embodiment provides a system that facilitates efficient storage and retrieval using erasure coding. During operation, the system determines a finite field solution that conforms to both locality and maximum distance separable (MDS) properties of an erasure-coding system. The system determines a generator matrix of the erasure-coding system based on the finite field solution and generates, from a data element, a plurality of coded fragments based on the generator matrix of the erasure-coding system. The plurality of coded fragments includes a set of enhanced coded fragments that allows reconstruction of the data element and a set of regular coded fragments. The number of the enhanced coded fragments can be fewer than a threshold number of coded fragments for the erasure-coding system.

Abstract: One embodiment provides a system that facilitates integrated security and high availability. During operation, the system obtains a number of data elements from a data stream based on a number of coded fragments that a code word includes. The system determines one or more bit-level operations for the data elements in such a way that at least one of the one or more bit-level operations becomes eliminated from a process of erasure encoding. The system then obfuscates the data elements based on one or more bit-level operations. Subsequently, the system generates a code word of the erasure encoding from the obfuscated data elements based on the generator matrix. The code word comprises a plurality of coded fragments.

Abstract: One embodiment provides a system that facilitates numerical operation-based erasure coding. During operation, the system determines the bit-width of processing capability of the computing system. The system then determines, based on the bit-width, a number of bits for representing a respective data element from a data stream and a number of data elements based on a number of a dimension of a generator matrix of erasure encoding. The system then obtains the number of data elements from the data stream and converts a respective obtained data element to a corresponding numerical representation. Here, a respective obtained data element is represented by the determined number of bits. The system then generates a code word, which comprises a plurality of coded fragments, of erasure encoding from the numerical representations based on the generator matrix of the erasure encoding.

Abstract: A method of optimizing the number and type of database backups to achieve a given RTO is provided and may include receiving a RTO and receiving a heuristic for determining an amount of unencumbered processing time. A type of next backup, (i.e., a next backup), is determined wherein the type of next backup is an incremental backup when the sum of the heuristic, and the times to: restore the latest full backup, restore zero or more incremental backups, complete a current incremental backup, and perform a full backup is less than the received RTO, else the type of the next backup is a full backup. A time to schedule the next backup is scheduled based on the received RTO being a total of an amount of time to: complete the type of next backup; rollforward zero or more transaction log records; and to restore at least one backup.

Abstract: A method of optimizing the number and type of database backups to achieve a given RTO is provided and may include receiving a RTO and receiving a heuristic for determining an amount of unencumbered processing time. A type of next backup, (i.e., a next backup), is determined wherein the type of next backup is an incremental backup when the sum of the heuristic, and the times to: restore the latest full backup, restore zero or more incremental backups, complete a current incremental backup, and perform a full backup is less than the received RTO, else the type of the next backup is a full backup. A time to schedule the next backup is scheduled based on the received RTO being a total of an amount of time to: complete the type of next backup; rollforward zero or more transaction log records; and to restore at least one backup.

Abstract: A method of optimizing the number and type of database backups to achieve a given RTO is provided and may include receiving a RTO and receiving a heuristic for determining an amount of unencumbered processing time. A type of next backup, (i.e., a next backup), is determined wherein the type of next backup is an incremental backup when the sum of the heuristic, and the times to: restore the latest full backup, restore zero or more incremental backups, complete a current incremental backup, and perform a full backup is less than the received RTO, else the type of the next backup is a full backup. A time to schedule the next backup is scheduled based on the received RTO being a total of an amount of time to: complete the type of next backup; rollforward zero or more transaction log records; and to restore at least one backup.

Abstract: A method of classifying and monitoring database operations based on a recovery cost may include receiving an indication of a recoverable operation. A count in a persistent storage, such as a catalog, corresponding to an occurrence of the recoverable operation is incremented.

Abstract: A method of classifying and monitoring database operations based on a recovery cost may include receiving an indication of a recoverable operation. A count in a persistent storage, such as a catalog, corresponding to an occurrence of the recoverable operation is incremented.

Abstract: A method of optimizing the number and type of database backups to achieve a given RTO is provided and may include receiving a RTO and receiving a heuristic for determining an amount of unencumbered processing time. A type of next backup, (i.e., a next backup), is determined wherein the type of next backup is an incremental backup when the sum of the heuristic, and the times to: restore the latest full backup, restore zero or more incremental backups, complete a current incremental backup, and perform a full backup is less than the received RTO, else the type of the next backup is a full backup. A time to schedule the next backup is scheduled based on the received RTO being a total of an amount of time to: complete the type of next backup; rollforward zero or more transaction log records; and to restore at least one backup.

Abstract: A method of classifying and monitoring database operations based on a recovery cost may include receiving an indication of a recoverable operation. A count in a persistent storage, such as a catalog, corresponding to an occurrence of the recoverable operation is incremented.

Abstract: A method of classifying and monitoring database operations based on a recovery cost may include receiving an indication of a recoverable operation. A count in a persistent storage, such as a catalog, corresponding to an occurrence of the recoverable operation is incremented.

Abstract: Techniques are disclosed for performing an operation for determining whether a standby database is synchronized with a primary database in a log shipping physical database replication environment. In one embodiment, the operation may include receiving a transaction log at the standby database from the primary database. The transaction log may specify a first one or more checksum values for a first set of pages on the primary database. The operation may also include calculating a second one or more checksum values for a second set of pages on the standby database. The operation may also include determining whether the standby database is synchronized with the primary database by comparing the first one or more checksum values with the second one or more checksum values.

Abstract: Techniques are disclosed for performing an operation for determining whether a standby database is synchronized with a primary database in a log shipping physical database replication environment. In one embodiment, the operation may include receiving a transaction log at the standby database from the primary database. The transaction log may specify a first one or more checksum values for a first set of pages on the primary database. The operation may also include calculating a second one or more checksum values for a second set of pages on the standby database. The operation may also include determining whether the standby database is synchronized with the primary database by comparing the first one or more checksum values with the second one or more checksum values.