Federated Database Query Routing via Cross-Database Replicas
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Database systems face challenges in efficiently routing data requests across multiple storage mediums with differing processing speeds, often leading to slower storage mediums handling frequent requests and transmitting 'stale' data.
Innovation Solution
A system where a server manages data replication between faster and slower storage mediums, using asynchronous data replication to keep the slower mediums updated, and determines the best storage medium to route requests based on data freshness, utilizing filter conditions and status management to optimize data access.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of energy
If data is stored on slower storage mediums to reduce cost, then storage cost is reduced, but data access speed deteriorates
Solution Approach 1:
The patent segments data into hot data (frequently accessed) and cold data (infrequently accessed), storing hot data on fast storage mediums and cold data on slower, cheaper storage mediums. This segmentation allows the system to optimize both cost and access speed by matching data storage location with access frequency patterns.
Solution Approach 2:
The patent implements dynamic data migration between storage mediums based on access patterns. Data that transitions from infrequent to frequent access is automatically moved from slow to fast storage, and vice versa. This dynamic adjustment ensures that the system continuously optimizes the balance between storage cost and access speed.
2Speed
If data is cached in memory for faster access, then data access speed is improved, but system cost increases
Solution Approach 1:
The patent applies local quality by providing high-speed memory storage specifically for hot data that requires frequent access, while using slower, cheaper storage for cold data. This localized optimization ensures that expensive memory resources are only allocated where they provide the most value, rather than uniformly across all data.
Solution Approach 2:
The patent uses partial action by caching only the most frequently accessed data in memory rather than all data. This selective caching approach provides sufficient speed improvement for critical operations while avoiding the excessive cost of maintaining entire datasets in expensive memory.
3Reliability
If data is replicated across multiple storage mediums for redundancy, then data reliability is improved, but storage complexity increases
Solution Approach 1:
The patent creates copies of data across different storage mediums to ensure redundancy and reliability. Critical data is replicated across multiple storage locations, and the system maintains synchronization between these copies, ensuring data integrity while distributing the reliability burden across the storage hierarchy.
4Reliability
If asynchronous replication is used to update slower storage mediums, then data consistency is maintained, but update time increases
Solution Approach 1:
The patent implements periodic synchronization where data is replicated from fast to slow storage mediums at scheduled intervals rather than continuously. This periodic action maintains data consistency across storage mediums while avoiding the continuous overhead of real-time replication, thus reducing the time penalty for maintaining consistency.
Data Source
AI summary
Disclosed herein are system, method, and computer program product embodiments for appropriately routing requests for data stored in multiple storage mediums. An embodiment operates by maintaining a first and second data stored on a first storage medium in communication with a second storage medium. Thereafter, a replicate of the first data stored in the first storage medium may be created for the second storage medium to store a replica data mirroring the first data. Subsequently, a request for retrieval of the first data may be received. Afterward, a previous update time of the second storage medium in receiving the replicate of the first data stored in the first storage medium may be determined. Lastly, based on the previous update time, the request may be forwarded to the first storage medium or second storage medium.