Coordinator Node Multi-Distribution Key Storage
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current data storage methods in distributed data management systems face inefficiencies in data query processes due to high probabilities of querying non-distribution keys, leading to increased data redistribution between nodes and network overheads, which hinder high-efficiency querying.
Innovation Solution
A data storage method where a coordinator node determines multiple distribution keys for each data table identifier, allowing data to be saved across multiple nodes with corresponding storage areas, increasing the likelihood of querying distribution keys and reducing unnecessary data redistribution by using both public and private storage areas effectively.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If data is stored using a single distribution key in a distributed data management system, then data can be evenly distributed across data nodes, but the probability of querying non-distribution keys increases, leading to frequent data redistribution between nodes and reduced query efficiency
Solution Approach 1:
The patent divides the storage structure into public storage areas and private storage areas across multiple data nodes. Each data node contains both public storage areas (accessible by all nodes) and private storage areas (specific to particular distribution keys). This segmentation allows data to be stored in public areas when possible, reducing redistribution needs, while maintaining efficient access through private areas when distribution keys are used.
Solution Approach 2:
The patent introduces a new dimension to data storage by allowing data to be accessed through multiple distribution keys simultaneously. Instead of a single distribution key mapping, the system creates multi-dimensional storage paths where data can be located through different distribution keys, increasing the likelihood that query keys will match stored distribution keys and reducing redistribution requirements.
2Reliability
If data is redistributed between multiple data nodes during query operations, then data can be retrieved even when queried keys do not match distribution keys, but network overhead increases and query performance decreases
Solution Approach 1:
The patent performs preliminary actions by pre-storing data in both public storage areas and private storage areas associated with multiple distribution keys. This advance preparation ensures that when queries are executed, the data is already positioned for efficient retrieval without requiring real-time redistribution operations, thus reducing query processing time while maintaining reliability.
3Productivity
If multiple distribution keys are used for each data table identifier, then data can be stored across multiple nodes with corresponding storage areas, but storage space utilization and network load management become more complex
Solution Approach 1:
The patent makes storage areas universal by creating public storage areas that can be accessed by any data node and private storage areas that serve multiple distribution keys. This multi-functionality allows the same storage infrastructure to handle both single-key and multi-key distribution scenarios, reducing the complexity of managing multiple distribution keys while maintaining high query efficiency.
Data Source
Figure 1~2
Figure 2a-1
Figure 2a-2
AI summary
Embodiments of the present invention relate to the field of data information management technologies, and in particular, to a data storage method and a coordinator node, so that data can be effectively stored, to improve data query efficiency in data query. In the embodiments of the present invention, a CN determines, according to a data table identifier corresponding to one piece of obtained data, multiple distribution keys corresponding to the data table identifier, and the CN sends, according to the multiple distribution keys, the data and a storage area identifier corresponding to each of at least one data node to the at least one data node. Each of the at least one data node is corresponding to at least one distribution key, the storage area identifier of each of the at least one data node represents the at least one distribution key corresponding to the data node, and the storage area identifier corresponding to each of the at least one data node is used by each of the at least one data node to save the data in a storage area of the data node.