Hierarchical Node Addressing for Selective Data Synchronization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data sync techniques, such as those based on SyncML, cannot efficiently sync specific nodes or sub-trees within a hierarchical tree structure, nor can they handle data items belonging to multiple categories, leading to inefficiencies and resource wastage in data synchronization.
Innovation Solution
A method and apparatus for synchronizing data by obtaining the address of an informational node within a hierarchical tree structure, allowing for targeted synchronization during the sync initialization phase, using Uniform Resource Identifiers (URIs) or filter conditions to specify the node, and performing the synchronization during the sync phase, thereby enabling flexible data sync without transmitting the entire database.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the entire database is synchronized between client and server, then data completeness is ensured, but data transmission volume and synchronization time increase significantly
Solution Approach 1:
The patent segments the database into hierarchical nodes (folders and files) allowing selective synchronization of specific nodes rather than the entire database. The sync command includes a node identifier that specifies which hierarchical node to synchronize, enabling partial sync of only the required portions of the database.
Solution Approach 2:
The patent extracts and transmits only the necessary data portions (specific nodes or sub-trees) identified by the node identifier in the sync command, rather than transmitting the entire database. This extraction approach reduces data transmission volume while maintaining data completeness for the required nodes.
2Reliability
If the entire database is synchronized, then all data is updated, but network bandwidth and system resources are wasted
Solution Approach 1:
The database is segmented into hierarchical nodes allowing the sync operation to target only specific segments (nodes or sub-trees) rather than the entire database. The node identifier in the sync command enables precise segmentation of the synchronization scope.
Solution Approach 2:
The patent implements partial action by synchronizing only the necessary portion of the database (specific node or sub-tree) rather than the entire database. This partial sync approach reduces network bandwidth consumption and system resource usage while ensuring data update completeness for the required nodes.
3Ease of manufacture
If traditional SyncML protocol is used without node addressing, then implementation is simple, but selective synchronization of specific nodes or sub-trees is not possible
Solution Approach 1:
The patent extends the existing SyncML protocol to serve multiple functions: it maintains backward compatibility for full database synchronization while adding node identifier support for selective node or sub-tree synchronization. This universal approach allows the same protocol to handle both complete and partial synchronization scenarios.
Solution Approach 2:
The sync command structure becomes dynamic by optionally including a node identifier. When the node identifier is present, selective synchronization is performed; when absent, full database synchronization occurs. This dynamic adaptability allows the protocol to flexibly respond to different synchronization requirements.
4Adaptability or versatility
If hierarchical tree structure is implemented for data organization, then data management flexibility improves, but complexity of synchronization protocol increases
Solution Approach 1:
The hierarchical tree structure is segmented into nodes with unique identifiers, allowing the sync protocol to reference and synchronize specific nodes or sub-trees by identifier. This segmentation approach maintains data management flexibility while simplifying the sync protocol through targeted node addressing.
Solution Approach 2:
The node identifier acts as an intermediary between the hierarchical tree structure and the sync protocol. Instead of the protocol directly handling complex hierarchical relationships, the node identifier mediates by providing a simple reference mechanism that enables selective synchronization while maintaining the benefits of hierarchical organization.
Data Source
Figure 1~2
Figure 3a~3b
Figure 4a~4b
AI summary
This invention discloses a method for data sync, applied between a client and a server for synchronizing data of a hierarchy structure comprising at least one node, including: sending, by one of the client and the server, a first sync command to the other side of the client and the server, determining a node to be synchronized before sending the first sync command; and performing data sync for the node to be synchronized on receiving the first sync command according to the first sync command. This invention further discloses a system, client and server for data sync, and the node-level data sync can be implemented by using the method of this invention.