Distributed Data Management Logical Nodes Value Range Updates
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing distributed data management systems face increased data access times and load on metadata servers when value ranges change, and P2P networks experience prolonged data access and management complexities due to link relationship updates.
Innovation Solution
A distributed data management system with logical nodes that utilize a node identifier storage, link table, value range storage, and tree structure data units to manage data units ordered by attribute value, allowing for efficient data access and reduced load by maintaining a communicable relationship and value range information without altering the link topology.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a client periodically makes an inquiry to the metadata server about value range changes, then the client can detect changes timely, but the load on the metadata server and communication load within the system increase
Solution Approach 1:
Each logical node autonomously maintains its own value range information and proactively notifies adjacent logical nodes of changes. This eliminates the need for clients to periodically query a centralized metadata server, as both clients and nodes can obtain value range information directly from the relevant logical nodes themselves.
Solution Approach 2:
The value range management functionality is extracted from the centralized metadata server and distributed to individual logical nodes. Each logical node independently manages its own value range information and notifies relevant parties of changes, removing the single point of load concentration.
2Productivity
If a value range of a data storage node changes, then the data storage capacity is optimized, but the data access time of clients increases due to detection delay
Solution Approach 1:
Logical nodes proactively notify adjacent logical nodes of value range changes before clients need to access the data. This advance notification ensures that clients have up-to-date routing information cached, eliminating detection delays when access requests are made.
Solution Approach 2:
A notification mechanism is established where logical nodes immediately inform adjacent nodes of value range changes. This feedback loop ensures that the distributed system maintains consistent knowledge of data locations without requiring clients to periodically query for updates.
3Stability of the object's composition
If link relationships among P2P nodes are sequentially changed to maintain balanced tree, then the data distribution is uniformed, but the data access time and management complexity increase
Solution Approach 1:
The system separates link relationship management from value range management. Logical nodes maintain stable link relationships based on identifier space positioning, while value range information is independently updated and notified. This segmentation allows value ranges to change without triggering link relationship reconfiguration.
Solution Approach 2:
The system allows value range information to be dynamic and independently adjustable without affecting the stable link topology. Logical nodes can adapt their value ranges in response to data distribution needs while maintaining fixed link relationships, enabling flexible data management without restructuring the network topology.
Data Source
AI summary
An object logical node achieved by a distributed data management device includes a storage unit for storing object node identifiers each uniquely assigned to a plurality of logical nodes, a storage unit for storing at least one of a plurality of partial data units, a link table for storing link information between the object logical node and a link destination logical node, a storage unit for storing a value range boundary value with respect to each attribute corresponding to the partial data unit, and a storage unit for storing a tree structure data unit with respect to each attribute including a plurality of tree nodes each indicating a value range for identifying the logical node storing the partial data unit corresponding to an access request, the tree structure data unit including a root tree node including at least one entry formed with a pointer pointing to a child tree node associated with the link destination logical node and a value indicating a value range for selecting the pointer.