Data Replication via Row Sequencing and Unique Identifiers
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data replication techniques in computer memory are inefficient, particularly when errors occur, as they often require loading and rehashing data across all copies, which is time-consuming and resource-intensive.
Innovation Solution
The system replicates data across different storage units using different sequences and hashing functions, allowing for efficient data retrieval and re-creation without the need to reshuffle or rehash data, by using a row identification engine, sequence engine, search engine, and re-creation engine to manage and recover data based on unique identifiers and sequences.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If data is replicated in multiple memory locations to address errors, then data reliability is improved, but existing replication techniques are inefficient and time-consuming
Solution Approach 1:
The system performs preliminary sequencing of data rows using different sequence engines before storage, creating pre-organized data structures that enable efficient recovery operations. By pre-establishing multiple sequences (first sequence, second sequence, third sequence) with different sorting criteria, the system avoids time-consuming rehashing during error recovery, as the data is already arranged in recoverable formats.
Solution Approach 2:
The patent segments data into rows with unique row identifications and organizes them into separate sequences using different sorting criteria. Each sequence engine creates a distinct ordering of the same data rows, allowing the system to segment recovery operations by sequence type rather than processing entire data sets, thereby reducing recovery time.
2Productivity
If data is replicated across multiple storage units with different sequences, then data recovery efficiency is improved, but system complexity increases
Solution Approach 1:
The sequence engines are designed to perform multiple functions: they sort data rows according to different criteria, generate sequence information, and create recoverable data structures. This multi-functionality reduces the need for separate specialized components for each recovery operation, managing system complexity while maintaining high recovery efficiency across multiple storage units.
Solution Approach 2:
The system creates simplified copies of data in different sequences across multiple storage units, where each copy contains the same data rows but organized differently. These copies include sequence information that enables rapid identification and recovery without requiring complex reconstruction algorithms, thus improving productivity while controlling complexity.
3Reliability
If existing replication techniques are used, then data redundancy is achieved, but rehashing and reshuffling data is resource-intensive
Solution Approach 1:
The system performs preliminary sorting and sequencing of data rows before replication, organizing data into multiple pre-defined sequences with different sorting criteria. This preliminary action eliminates the need for resource-intensive rehashing during recovery operations, as the data is already arranged in the required formats across different storage units.
Solution Approach 2:
The patent changes the organizational parameters of data by creating multiple sequences with different sorting criteria (first sequence, second sequence, third sequence). Each sequence represents a different parameter arrangement of the same data, allowing the system to retrieve data in various formats without rehashing, thereby reducing energy consumption while maintaining data redundancy.
Data Source
AI summary
In one embodiment, a system includes one or more processors and a memory storing instructions that, when executed by the one or more processors, cause the one or more processors to perform operations including sequencing a plurality of rows into a first sequence based on a first criteria and determining to store a first set of the plurality of rows in a first block of a first storage unit in accordance with the first sequence. The operations further include determining to store, in a first block of the second storage unit, a block identification of the first block of the first storage unit and a row identification for each row of the first set of the plurality of rows. The operations further include re-creating the first set of the plurality of rows of the first block of the first storage unit using information stored in the second storage unit.