Data Relocation via Optimistic Locking and Replication
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Centralized consistent location services in distributed data storage systems are inefficient and resource-intensive, and may not be applicable in tiered data storage systems, where data is moved between different tiers based on access criteria, leading to operational inefficiencies and increased costs.
Innovation Solution
Implementing a data relocation mechanism that uses optimistic locking and replication steps to move data objects between tiered data stores without a central consistent location service, ensuring data integrity and consistency through state fields and version numbers, and employing retry mechanisms for failure recovery.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a centralized consistent location service is used to coordinate data relocations, then data consistency can be maintained, but operational efficiency decreases due to frequent interactions with the service
Solution Approach 1:
The patent extracts the location service functionality from a centralized model and distributes it to individual data stores. Each data store maintains its own location information and state fields, eliminating the need for frequent centralized coordination while maintaining data consistency through distributed state management.
2Reliability
If a centralized consistent location service is implemented, then data relocation coordination is achieved, but computing and technical support resources increase
Solution Approach 1:
The patent implements self-service by enabling data stores to autonomously manage their own location information through state fields and version numbers. Each data store independently tracks its own relocation status without requiring external coordination services, reducing computing resource requirements.
3Reliability
If a centralized consistent location service is used, then data relocation coordination is possible, but system vulnerability increases due to single point of failure
Solution Approach 1:
The patent segments the centralized location service functionality into distributed components at each data store. By dividing the coordination function across multiple independent data stores with their own state fields, the system eliminates the single point of failure inherent in centralized services.
4Productivity
If data is moved between tiered data stores without a central consistent location service, then operational cost decreases, but data consistency may be compromised
Solution Approach 1:
The patent implements feedback mechanisms through state fields and version numbers that continuously track data location and consistency status. This feedback enables automated consistency verification and recovery without centralized coordination, maintaining reliability while reducing operational costs.
Data Source
AI summary
A data object may be moved from a source data store to a destination data store via replication. The replication is initiated when an original data object in a source data store that is capable of being both read from and being written to is read. Following the read, the original data object is then duplicated to a destination data store. The duplicate data object is provided with a state that indicates the duplicate object is duplicated from the source data store and can be read but cannot accept a data write. Subsequently, the state of the original data object is changed to can be read but cannot be written to using optimistic locking. Further, the state of the duplicate data object is also modified to being capable of both read from and written to with the use of optimistic locking. The replication is completed with the deletion of the original data object from the source data store.